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

Complexity of single machine, multi-criteria scheduling problems

โœ Scribed by Chuen-Lung Chen; Robert L. Bulfin

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
688 KB
Volume
70
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Complexity of single machine scheduling
Complexity of single machine scheduling problems under scenario-based uncertainty
โœ Mohamed Ali Aloulou; Federico Della Croce ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 256 KB

We present algorithmic and computational complexity results for several single machine scheduling problems where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. We use here the so-called absolute robustness criterion to select among

Complexity of two dual criteria scheduli
Complexity of two dual criteria scheduling problems
โœ Yumei Huo; J.Y.-T. Leung; Hairong Zhao ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB

In this article we answer the complexity question of two dual criteria scheduling problems which had been open for a long time. We show that both problems are binary NP-hard.

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