A branch & bound algorithm for the open-shop problem

DC FieldValueLanguage
dc.contributor.authorBrucker, P
dc.contributor.authorHurink, J
dc.contributor.authorJurisch, B
dc.contributor.authorWostmann, B
dc.date.accessioned2021-12-23T15:57:31Z-
dc.date.available2021-12-23T15:57:31Z-
dc.date.issued1997
dc.identifier.issn0166218X
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/2973-
dc.description.abstractA fast branch & bound method for the open-shop problem based on a disjunctive graph formulation of the problem is developed. Computational results show that the method yields excellent results. Some benchmark problems from the literature were solved to optimality for the first time.
dc.language.isoen
dc.publisherELSEVIER SCIENCE BV
dc.relation.ispartofDISCRETE APPLIED MATHEMATICS
dc.subjectbranch & bound method
dc.subjectMathematics
dc.subjectMathematics, Applied
dc.subjectopen-shop scheduling
dc.titleA branch & bound algorithm for the open-shop problem
dc.typejournal article
dc.identifier.doi10.1016/S0166-218X(96)00116-3
dc.identifier.isiISI:A1997XG27200004
dc.description.volume76
dc.description.issue1-3
dc.description.startpage43
dc.description.endpage59
dc.contributor.orcid0000-0001-6986-5633
dc.contributor.researcheridI-4491-2019
dc.publisher.placePO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS
dcterms.isPartOf.abbreviationDiscret Appl. Math.
dcterms.oaStatusBronze, Green Published
Show simple item record

Page view(s)

2
Last Week
0
Last month
0
checked on Jun 6, 2024

Google ScholarTM

Check

Altmetric