✦ LIBER ✦

Scheduling batches with simultaneous job processing for two-machine shop problems

✍ Scribed by C. N. Potts; V. A. Strusevich; T. Tautenhahn

Publisher: Springer US
Year: 2001
Tongue: English
Weight: 210 KB
Volume: 4
Category: Article
ISSN: 1094-6136
DOI: 10.1002/1099-1425(200101/02)4:1<25::aid-jos58>3.0.co;2-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The open shop scheduling problem with a

The open shop scheduling problem with a given sequence of jobs on one machine

✍ Y.M. Shafransky; V.A. Strusevich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 186 KB 👁 2 views

The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a

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.