LOWER BOUNDS FOR THE JOB-SHOP SCHEDULING PROBLEM ON MULTIPURPOSE MACHINES

Autor(en): JURISCH, B
Stichwörter: JOB-SHOP SCHEDULING; LOWER BOUND; Mathematics; Mathematics, Applied; MULTIPURPOSE MACHINES; SHORTEST PATH PROBLEM WITH OBSTACLES
Erscheinungsdatum: 1995
Herausgeber: ELSEVIER SCIENCE BV
Journal: DISCRETE APPLIED MATHEMATICS
Volumen: 58
Ausgabe: 2
Startseite: 145
Seitenende: 156
Zusammenfassung: 
The job-shop problem on multi-purpose machines (MPM job-shop problem) arises in the area of flexible manufacturing systems. It is a generalization of the classical job-shop scheduling problem. We develop a lower bound for the MPM job-shop problem. It is based on a two-job relaxation which can be solved efficiently by using geometric methods.
ISSN: 0166218X
DOI: 10.1016/0166-218X(93)E0124-H

Show full item record

Google ScholarTM

Check

Altmetric