✦ LIBER ✦

An adaptive branching rule for the permutation flow-shop problem

✍ Scribed by C.N. Potts

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 820 KB
Volume: 5
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(80)90069-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An approximation algorithm for the m-mac

An approximation algorithm for the m-machine permutation flow shop scheduling problem with controllable processing times

✍ Eugeniusz Nowicki 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 423 KB

An improved branch and bound procedure f

An improved branch and bound procedure for n × m flow shop problems

✍ S. S. Panwalkar; A. W. Khan 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

The effectiveness of the longest deliver

The effectiveness of the longest delivery time rule for the flow shop delivery time problem

✍ Philip Kaminsky 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.