𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient heuristic for total flowtime minimisation in no-wait flowshops

✍ Scribed by José Manuel Framinan; Marcelo Seido Nagano; João Vitor Moccellin

Publisher
Springer
Year
2009
Tongue
English
Weight
177 KB
Volume
46
Category
Article
ISSN
0268-3768

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient heuristic for scheduling in
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
✍ Chandrasekharan Rajendran; Hans Ziegler 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 640 KB

The problem of scheduling in a flowshop is considered with the objective of minimizing the total weighted flowtime of jobs. A heuristic algorithm is developed by the introduction of lower bounds on the completion times of jobs and the development of heuristic preference relations for the scheduling

Heuristics for two-machine no-wait flows
Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
✍ Guoqing Wang; T.C.Edwin Cheng 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 75 KB

In this paper we study the two-machine no-wait flowshop problem with an availability constraint. The problem has been shown to be NP-hard, and some heuristics with a worst-case error bound of 2 have been developed for it. We provide two improved heuristics for the problem, and show that each has a w