A Multi-Machine Scheduling Problem with Global Non Idling Constraint

Philippe Chrétienne (1) , Samuel Deleplanque (2) , Alain Quilliot (2)

1 RO - Recherche Opérationnelle
2 LIMOS - Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes

We deal here with a multi-machine scheduling problem with non idling constraints, i.e constraints which forbids the interruption of the use of the processors. We reformulate the problem, while using specific pyramidal profile functions, next get a min-max feasibility criterion and finally derive exact polynomial algorithms for both the feasibility problem and the makespan optimization problem.

Mots clés: bipartite graph matching; non idling constraint; Multi-machine scheduling

Domaines: Algorithme et structure de données [cs.DS]

Philippe Chrétienne, Samuel Deleplanque, Alain Quilliot. A Multi-Machine Scheduling Problem with Global Non Idling Constraint. 7th IFAC Conference on Manufacturing Modelling, Management, and Control, Jun 2013, Saint Petersburg, Russia. pp.1262-1267, ⟨10.3182/20130619-3-RU-3018.00456⟩. ⟨hal-00871692⟩