✦ LIBER ✦

Scheduling stochastic jobs with due dates on parallel machines

✍ Scribed by Hamilton Emmons; Michael Pinedo

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 592 KB
Volume: 47
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(90)90088-s

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel machine scheduling with release

Parallel machine scheduling with release dates, due dates and family setup times

✍ J.M.J. Schutten; R.A.M. Leussink 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Scheduling jobs and maintenance activiti

Scheduling jobs and maintenance activities on parallel machines

✍ Chung-Yee Lee; Zhi-Long Chen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

Most machine scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines need to be maintained and hence may become unavailable during certain periods. In this paper, we study the problem of processing a set of n jobs on m parallel machin

Job shop scheduling with modified due da

Job shop scheduling with modified due dates

✍ Kenneth R. Baker; John J. Kanet 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 773 KB

Due-date assignment and early/tardy sche

Due-date assignment and early/tardy scheduling on identical parallel machines

✍ Prabuddha De; Jay B. Ghosh; Charles E. Wells 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 871 KB

A heuristic for parallel machine schedul

A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs

✍ Chung-Lun Li 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Parallel machine scheduling with job ass

Parallel machine scheduling with job assignment restrictions

✍ Celia A. Glass; Hans Kellerer 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

## Abstract In the classical multiprocessor scheduling problem independent jobs must be assigned to parallel, identical machines with the objective of minimizing the makespan. This article explores the effect of assignment restrictions on the jobs for multiprocessor scheduling problems. This means