✦ LIBER ✦

A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times

✍ Scribed by ROGER Z. RÍOS-MERCADO; JONATHAN F. Bard

Book ID: 110252746
Publisher: Taylor and Francis Group
Year: 1999
Tongue: English
Weight: 172 KB
Volume: 31
Category: Article
ISSN: 0740-817X
DOI: 10.1023/a:1007650011043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition methods for reentrant flow

Decomposition methods for reentrant flow shops with sequence-dependent setup times

✍ Ebru Demirkol; Reha Uzsoy 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 345 KB

We consider the problem of scheduling a reentrant #ow shop with sequence-dependent setup times to minimize maximum lateness. We develop a series of decomposition methods (DMs) exploring the importance of components such as subproblem solution method, bottleneck identi"cation and reoptimization metho

A branch and bound method for the job-sh

A branch and bound method for the job-shop problem with sequence-dependent setup times

✍ Christian Artigues; Dominique Feillet 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 481 KB

A branch-and-price algorithm for schedul

A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times

✍ Manuel J. Pereira Lopes; J.M. Valério de Carvalho 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 240 KB

Two branch and bound algorithms for the

Two branch and bound algorithms for the permutation flow shop problem

✍ Jacques Carlier; Ismaïl Rebaï 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 957 KB

A flow-shop problem with sequence-depend

A flow-shop problem with sequence-dependent additive setup times

✍ Wlodzimierz Szwarc; Jatinder N. D. Gupta 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 388 KB

Robust metaheuristics for group scheduli

Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops

✍ M. Zandieh; Behrouz Dorri; A. R. Khamseh 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 256 KB