Formal languages for integer programming modeling of shift scheduling problems

Constraints ◽  
2009 ◽  
Vol 16 (1) ◽  
pp. 54-76 ◽  
Author(s):  
Marie-Claude Côté ◽  
Bernard Gendron ◽  
Claude-Guy Quimper ◽  
Louis-Martin Rousseau
2011 ◽  
Vol 57 (1) ◽  
pp. 151-163 ◽  
Author(s):  
Marie-Claude Côté ◽  
Bernard Gendron ◽  
Louis-Martin Rousseau

2010 ◽  
Vol 36 ◽  
pp. 727-734 ◽  
Author(s):  
Marie-Claude Côté ◽  
Bernard Gendron ◽  
Louis-Martin Rousseau

2013 ◽  
Vol 437 ◽  
pp. 748-751
Author(s):  
Chi Yang Tsai ◽  
Yi Chen Wang

This research considers the problem of scheduling jobs on unrelated parallel machines with inserted idle times to minimize the earliness and tardiness. The aims at investigating how particular objective value can be improved by allowing machine idle time and how quality solutions can be more effectively obtained. Two mixed-integer programming formulations combining with three dispatching rules are developed to solve such scheduling problems. They can easy provide the optimal solution to problem involving about nine jobs and four machines. From the results of experiments, it is found that: (1) the inserted idle times decreases objective values more effectively; (2) three dispatching rules are very competitive in terms of efficiency and quality of solutions.


Sign in / Sign up

Export Citation Format

Share Document