✦ LIBER ✦

A new algorithmic approach for capacitated lot-sizing problem in flow shops with sequence-dependent setups

✍ Scribed by M. Mohammadi; S. A. Torabi; S. M. T. Fatemi Ghomi; B. Karimi

Publisher: Springer
Year: 2009
Tongue: English
Weight: 199 KB
Volume: 49
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-009-2366-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simulated annealing algorithm approach

A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times

✍ H. S. Mirsanei; M. Zandieh; M. J. Moayed; M. R. Khabbazi 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 624 KB

Two machine flow shop scheduling problem

Two machine flow shop scheduling problems with sequence dependent setup times: A dynamic programming approach

✍ Burton D. Corwin; Augustine O. Esogbue 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

A genetic algorithm for integrating lot-

A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line

✍ Riyaz Sikora 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 891 KB

A new algorithm for determining producti

A new algorithm for determining production schedules when solving the multi-product economic lot sizing problem in flow shops

✍ Jia-Yen Huang; Ming-Jong Yao 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 309 KB

A hybrid simulated annealing for the sin

A hybrid simulated annealing for the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and costs and dynamic release of jobs

✍ Mohammad Mirabi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 369 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.