✦ LIBER ✦

A heuristic for the two-machine no-wait openshop scheduling problem

✍ Scribed by Jeffrey B. Sidney; Chelliah Sriskandarajah

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 176 KB
Volume: 46
Category: Article
ISSN: 0894-069X
DOI: 10.1002/(sici)1520-6750(199903)46:2<129::aid-nav1>3.0.co;2-3

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 👁 1 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

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.