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

Complexity results for scheduling chains on a single machine

โœ Scribed by J.K. Lenstra; A.H.G. Rinnooy Kan

Book ID
107989306
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
597 KB
Volume
4
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Single machine scheduling problems with
Single machine scheduling problems with financial resource constraints: Some complexity results and properties
โœ Evgeny R. Gafarov; Alexander A. Lazarev; Frank Werner ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB

We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number o

Complexity results for parallel machine
Complexity results for parallel machine problems with a single server
โœ Peter Brucker; Clarisse Dhaenens-Flipo; Sigrid Knust; Svetlana A. Kravchenko; Fr ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer US ๐ŸŒ English โš– 270 KB

Parallel machine problems with a single server are generalizations of classical parallel machine problems. Immediately before processing, each job must be loaded on a machine, which takes a certain set-up time. All these set-ups have to be done by a single server which can handle at most one job at