✦ LIBER ✦

Makespan minimization form-machine permutation flowshop scheduling problem with learning considerations

✍ Scribed by Yu-Hsiang Chung; Lee-Ing Tong

Publisher: Springer
Year: 2011
Tongue: English
Weight: 250 KB
Volume: 56
Category: Article
ISSN: 0268-3768
DOI: 10.1007/s00170-011-3172-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Makespan minimization in the two-machine

Makespan minimization in the two-machine flowshop batch scheduling problem

✍ T.C.E. Cheng; B.M.T. Lin; A. Toker 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 2 views

In this paper we consider a practical scheduling problem commonly arising from batch production in a flexible manufacturing environment. Different part-types are to be produced in a flexible manufacturing cell organized into a two-stage production line. The jobs are processed in batches on the first

Minimizing makespan in a two-machine flo

Minimizing makespan in a two-machine flowshop scheduling with batching and release time

✍ Lixin Tang; Peng Liu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

A two-machine flowshop maximum tardiness

A two-machine flowshop maximum tardiness scheduling problem with a learning effect

✍ Chin-Chia Wu; Wen-Chiung Lee; Wei-Chieh Wang 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 168 KB

A bi-criterion single-machine scheduling

A bi-criterion single-machine scheduling problem with learning considerations

✍ Wen-Chiung Lee; Chin-Chia Wu; Hua-Jung Sung 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 142 KB

Single machine batch scheduling problem

Single machine batch scheduling problem with family setup times and release dates to minimize makespan

✍ J. J. Yuan; Z. H. Liu; C. T. Ng; T. C. E. Cheng 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 315 KB

Heuristics for the two-machine flowshop

Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times

✍ Ali Allahverdi; Harun Aydilek 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 870 KB