A NEW LOWER BOUND FOR THE JOB-SHOP SCHEDULING PROBLEM

Autor(en): BRUCKER, P
JURISCH, B
Stichwörter: ALGORITHM; Business & Economics; JOB-SHOP SCHEDULING; LOWER BOUND; Management; Operations Research & Management Science; SHORTEST PATH PROBLEM WITH OBSTACLES
Erscheinungsdatum: 1993
Herausgeber: ELSEVIER SCIENCE BV
Journal: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volumen: 64
Ausgabe: 2
Startseite: 156
Seitenende: 167
Zusammenfassung: 
A new lower bound for the job-shop scheduling problem is developed. This lower bound is based on a two-job relaxation which can be solved efficiently by using geometeric methods. Computational experiments show that the new lower bound improves the classical lower bound if the ratio between the number of machines and the number of jobs is large.
ISSN: 03772217
DOI: 10.1016/0377-2217(93)90174-L

Show full item record

Page view(s)

1
Last Week
0
Last month
1
checked on May 21, 2024

Google ScholarTM

Check

Altmetric