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
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : A single machine scheduling problem is studied. The set of n jobs has been partitioned into g groups on the basis of group technology. Jobs of the same group are required to be processed contiguously. The processing of each group is preceeded by a sequence independent setup time. The setup times and the job processing times can be linearly compressed through allocation of a continuously divisible or discrete resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that of the jobs. Polynomial time algorihms are presented to find an optimal job sequence and resource values such that the total weighted resource consumption is minimum, subject to meeting job deadlines. The algorithms are based on solving linear programming problems with two variables by geometric techniques.
Type de document :
Rapport
[Intern report] A01-R-176 || janiak01c, 2001, 16 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00100695
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:49:39
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100695, version 1

Collections

Citation

Adam Janiak, Mikhail Y. Kovalyov, Marie-Claude Portmann. Single Machine Group Scheduling with Resource Dependent Setup and Processing Times. [Intern report] A01-R-176 || janiak01c, 2001, 16 p. 〈inria-00100695〉

Partager

Métriques

Consultations de la notice

53