A Branch and Bound Method for the Open Shop Problem

P. Brucker; Johann L. Hurink; B. Jurisch; B. Wöstmann

doi:10.1016/S0166-218X(96)00116-3

A Branch and Bound Method for the Open Shop Problem

P. Brucker, Johann L. Hurink, B. Jurisch, B. Wöstmann

Discrete Mathematics and Mathematical Programming

Research output: Contribution to journal › Article › Academic › peer-review

127 Citations (Scopus)

666 Downloads (Pure)

Abstract

A 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.

Original language	English
Pages (from-to)	43-59
Number of pages	17
Journal	Discrete applied mathematics
Volume	76
Issue number	1-3
DOIs	https://doi.org/10.1016/S0166-218X(96)00116-3
Publication status	Published - 13 Jun 1997

Access to Document

10.1016/S0166-218X(96)00116-3Licence: Other

DAM76Final published version, 1.13 MBLicence: Other

Cite this

@article{8175b965d483433c92fa84f3c34436fe,

title = "A Branch and Bound Method for the Open Shop Problem",

abstract = "A 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.",

author = "P. Brucker and Hurink, {Johann L.} and B. Jurisch and B. W{\"o}stmann",

year = "1997",

month = jun,

day = "13",

doi = "10.1016/S0166-218X(96)00116-3",

language = "English",

volume = "76",

pages = "43--59",

journal = "Discrete applied mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - A Branch and Bound Method for the Open Shop Problem

AU - Brucker, P.

AU - Hurink, Johann L.

AU - Jurisch, B.

AU - Wöstmann, B.

PY - 1997/6/13

Y1 - 1997/6/13

N2 - A 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.

AB - A 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.

U2 - 10.1016/S0166-218X(96)00116-3

DO - 10.1016/S0166-218X(96)00116-3

M3 - Article

VL - 76

SP - 43

EP - 59

JO - Discrete applied mathematics

JF - Discrete applied mathematics

SN - 0166-218X

IS - 1-3

ER -

A Branch and Bound Method for the Open Shop Problem

Abstract

Access to Document

Fingerprint

Cite this