Single Machine Group Scheduling with Resource Dependent Setup and Processing Times

Adam Janiak , Mikhail Y. Kovalyov , Marie-Claude Portmann (1)

1 MACSI - Industrial system modeling, analysis and operation

On a single machine, a set of n jobs partitioned into g groups must be scheduled. Setup times and processing times can be linearly compressed by using a continuously divisible or discrete resource. Jobs must be finished before their deadlines. A polynomial algorithm is proposed.

Mots clés: resource allocation; ordonnancement à une machine; temps de réglage; délais absolus; allocation de ressources; one machine scheduling problem; set-up times; deadlines

Domaines: Autre [cs.OH]

Adam Janiak, Mikhail Y. Kovalyov, Marie-Claude Portmann. Single Machine Group Scheduling with Resource Dependent Setup and Processing Times. Fifth Workshop on Models and Algorithms for Planning and Scheduling Problems - MAPSP'2001, 2001, Aussois, France, 2 p. ⟨inria-00100518⟩