A NEW LOWER BOUND FOR THE JOB-SHOP SCHEDULING PROBLEM

DC FieldValueLanguage
dc.contributor.authorBRUCKER, P
dc.contributor.authorJURISCH, B
dc.date.accessioned2021-12-23T15:56:30Z-
dc.date.available2021-12-23T15:56:30Z-
dc.date.issued1993
dc.identifier.issn03772217
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/2377-
dc.description.abstractA 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.
dc.language.isoen
dc.publisherELSEVIER SCIENCE BV
dc.relation.ispartofEUROPEAN JOURNAL OF OPERATIONAL RESEARCH
dc.subjectALGORITHM
dc.subjectBusiness & Economics
dc.subjectJOB-SHOP SCHEDULING
dc.subjectLOWER BOUND
dc.subjectManagement
dc.subjectOperations Research & Management Science
dc.subjectSHORTEST PATH PROBLEM WITH OBSTACLES
dc.titleA NEW LOWER BOUND FOR THE JOB-SHOP SCHEDULING PROBLEM
dc.typejournal article
dc.identifier.doi10.1016/0377-2217(93)90174-L
dc.identifier.isiISI:A1993KF39500002
dc.description.volume64
dc.description.issue2
dc.description.startpage156
dc.description.endpage167
dc.publisher.placePO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationEur. J. Oper. Res.
Show simple item record

Google ScholarTM

Check

Altmetric