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...

This paper focuses on the multi-objective resolution of a reentrant hybrid flow shop scheduling problem (RHFS). In our case the two objectives are: the maximization of the utilization rate of the bottleneck and the minimization of the maximum completion time. This problem is solved with a new...

This paper investigates the existence of absolute optimal solutions for a partition P in continuous and quasiconcave games. We show that the P-consistency property introduced in the paper, together with the quasiconcavity and continuity of payoffs, permits the existence of P-absolute optimal...

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...

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...

A Vendor Managed Inventory (VMI) system consists of a manufacturing vendor and a number of retailers. In such a system, it is essential for the vendor to optimally determine retailer selection and other related decisions, such as the product’s replenishment cycle time and the wholesale price,...

This paper deals with the robust optimization for the cyclic hoist scheduling problem with processing time window constraints. The robustness of a cyclic hoist schedule is defined as its ability to remain stable in the presence of perturbations or variations of certain degree in the hoist...

We study an online scheduling problem on a single machine with delivery times. The problem is online in the sense that all jobs arrive over time. Each job's characteristics, such as processing time and delivery time, become known at its arrival time. Preemption is not allowed and once the...