✦ LIBER ✦

Parallel machines scheduling with nonsimultaneous machine available time

✍ Scribed by Chung-Yee Lee

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 674 KB
Volume: 30
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90013-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel machine scheduling with time de

Parallel machine scheduling with time dependent processing times

✍ Zhi-Long Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Scheduling parallel machines with major

Scheduling parallel machines with major and minor setup times

✍ Wittrock, RobertJ. 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 706 KB

This article discusses the problem of scheduling a large set of parts on an FMS so as to minimize the total completion time. Here, the FMS consists of a set of parallel identical machines. Setup time is incurred whenever a machine switches from one type of part to another. The setup time may be larg

Two-machine flowshop scheduling with ava

Two-machine flowshop scheduling with availability constraints

✍ Chung-Yee Lee 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 143 KB

The majority of the scheduling literature carries a common assumption that machines are available all the time. However, this availability assumption may not be true in real industry settings, since a machine may become unavailable during certain periods of time when, for instance, a machine breakdo

Scheduling jobs on parallel machines wit

Scheduling jobs on parallel machines with sequence-dependent setup times

✍ Young Hoon Lee; Michael Pinedo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 855 KB

Consider a number of jobs to be processed on a number of identical machines in parallel. A job has a processing time, a weight and a due date. If a job is followed by another job, a setup time independent of the machine is incurred. A three phase heuristic is presented for minimizing the sum of the

Two machine openshop scheduling with mac

Two machine openshop scheduling with machine-dependent processing times

✍ Asoo J. Vakharia; Bülent Çatay 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 408 KB

In a recent paper, Dror (1992) presented several results for openshop scheduling with machine dependent processing times. In this note, we present clarifications regarding the algorithm developed by him for minimizing the sum of job completion times (or average flow time) in a 2 machine openshop and

Parallel machine batching and scheduling

Parallel machine batching and scheduling with deadlines

✍ T. C. Edwin Cheng; Mikhail Y. Kovalyov 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 137 KB 👁 1 views

In this paper, we study the problem of scheduling n independent jobs non-preemptively on m unrelated parallel machines. Each job j has a processing time and a deadline, the time at which the job must be completed. On each machine, jobs may be grouped to form batches containing continuously scheduled