Journal article
APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- JANSEN, KLAUS Universität zu Kiel, Kiel, Germany
- MASTROLILLI, MONALDO Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Manno, Switzerland
- SOLIS-OBA, ROBERTO University of Western Ontario, London, Canada
- 2011-11-20
Published in:
- International Journal of Foundations of Computer Science. - World Scientific Pub Co Pte Lt. - 2005, vol. 16, no. 02, p. 361-379
English
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The problem is to assign operations to machines and to order the operations on the machines so that the operations can be processed in the smallest amount of time. This models a wide variety of problems encountered in real manufacturing systems. We present a linear time approximation scheme for the non-preemptive version of the problem when the number m of machines and the maximum number μ of operations per job are fixed. We also study the preemptive version of the problem when m and μ are fixed, and present a linear time approximation scheme for the problem without migration and a (2+ε)-approximation algorithm for the problem with migration.
- Language
-
- English
- Open access status
- closed
- Identifiers
-
- DOI 10.1142/s0129054105003030
- ISSN 0129-0541
- Persistent URL
- https://sonar.ch/global/documents/41220
Statistics
Document views: 25
File downloads: