𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Note: On the two-machine no-idle flowshop problem

✍ Scribed by Ondřej Čepek; Masanori Okada; Milan Vlach

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
290 KB
Volume
47
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified.

📜 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

Note: Two rendezvous search problems on
Note: Two rendezvous search problems on the line
✍ Vic Baston 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 28 KB

A new upper bound is obtained for the two-person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions an