We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard in the strong sense. We propose a lower bound based on splitting of jobs and the Viswanathkumar and Srinivasan procedure and a heuristic. The test on more than...

This paper addresses cyclic scheduling of a no-wait robotic cell with multiple robots. In contrast to many previous studies, we consider r-degree cyclic (r  1) schedules, in which r identical parts with constant processing times enter and leave the cell in each cycle. We propose an...

This research aims to build a feasible and efficient operating program for an endoscopy centre composed of two specialised operating rooms for one week, with the objective of both maximising the utilisation of the operating room and minimising the cost of overtime. First, a tactical planning...

In this paper, we consider the problem of scheduling tasks on two dedicated processors where some tasks need to be processed only by the first processor and some others by the second processor; the remaining tasks, however, need both processors simultaneously. Tasks have release dates and have...

We consider a single machine scheduling problem to minimize the weighted completion time variance. This problem is known to be NP-hard. We propose a heuristic and a lower bound based on job splitting and the Viswanathkumar and Srinivasan procedure. The test on more than 2000 instances shows that...

The traditional hypothesis of “rationality” is far from perfect. Models of fairness solely based on consequence cannot explain why the same consequence of an action is perceived and reciprocated differently. A reciprocity model which accounts for both consequence and its underlying intention...