𝔖 Bobbio Scriptorium
✦   LIBER   ✦

USING SHORT-TERM DEDICATION FOR SCHEDULING MULTIPLE PRODUCTS ON PARALLEL MACHINES

✍ Scribed by GERARD M. CAMPBELL

Book ID
114945489
Publisher
Production and Operations Management Society
Year
2009
Tongue
English
Weight
996 KB
Volume
1
Category
Article
ISSN
1059-1478

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Scheduling problems for parallel dedicat
Scheduling problems for parallel dedicated machines under multiple resource constraints
✍ H. Kellerer; V.A. Strusevich πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 249 KB

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classiΓΏcation is obtained, a number of polynomial-time algorithms are designed. For the problem with a ΓΏxed number of machines in which a job uses at mo

Exact algorithms for scheduling multiple
Exact algorithms for scheduling multiple families of jobs on parallel machines
✍ Zhi-Long Chen; Warren B. Powell πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 140 KB

## Abstract In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent o