Single Machine Group Scheduling with Resource Dependent Setup and Processing Times - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Single Machine Group Scheduling with Resource Dependent Setup and Processing Times

Adam Janiak
  • Function : Author
Mikhail Y. Kovalyov
  • Function : Author

Abstract

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

Dates and versions

inria-00100518 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100518 , version 1

Cite

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⟩
38 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More