𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem

✍ Scribed by Tobias Riege; Jörg Rothe

Publisher
Springer
Year
2004
Tongue
English
Weight
418 KB
Volume
39
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Special cases of the flow-shop problem
Special cases of the flow-shop problem
✍ Wlodzimierz Szwarc 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 385 KB

## Abstract The paper examines all known special cases of the __m__X__n__ flow‐shop problem. It provides solution procedures to three new special cases along with the optimality proofs. The theory of the new special cases is based on the critical path concept.

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.