๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead

โœ Scribed by Wenhua Li; Zhenkun Zhang; Sufang Yang

Book ID
113663317
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
170 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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