Subscription Canceling Simulator

You are tasked with canceling a subscription through a disgruntled customer service representative. This game aims to expose the mental strain put on those who handle customer service, and the idea that many don't realize it's a person behind the screen

Subscription Canceling Simulator

You are tasked with canceling a subscription through a disgruntled customer service representative. This game aims to expose the mental strain put on those who handle customer service, and the idea that many don't realize it's a person behind the screen

Turtle Quest

Turtle Quest is a game about collecting items. Vincent has a dream of becoming a turtle, and will do anything to make his dream come true. When a genie offers to turn him into a turtle for 7 gold, Vincent sets out to find them at all costs

Total completion time minimization for machine scheduling problem under time windows constraint constraints with linear processing rate function

International audienc

Reactive rescheduling method for electric vehicles charging in dedicated residential zone parking

International audienceUncertainties are among the biggest challenges to the electric vehicles (EV) charging scheduling problem. In this paper, we propose a predictive-reactive scheduling method to deal with those disturbances. This study is limited to the charging management of the dedicated residential zone parking. Hence the set of charging tasks is finite (static) and the random distributions of the arrival times and the daily charging demands are known. We propose a reactive partial reschedule strategy to tackle the online scheduling problem. The experimentation is set up to measure the performance of the method in two aspects: the objective value minimisation and the stability. Data used to conduct tests are collected throughout our industrial project. The reactive rescheduling method is implementable in standalone schedulers. Also, it is proved to be very efficient to solve the proposed problem

Solving a Malleable Jobs Scheduling Problem to Minimize Total Weighted Completion Times by Mixed Integer Linear Programming Models

International audienceIn this paper we report two mixed integer linear programming models to resolve the malleable jobs scheduling problem with single resource. Jobs’ release dates and deadlines are taken into account. The total amount of available resource of the system is variable at different times. Numerical experimentation is conducted to evaluate the performance variability between two introduced models. The objective of this optimization problem is to minimize the total weighted completion time