𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation schemes for single machine scheduling with non-renewable resource constraints

✍ Scribed by Györgyi, Péter; Kis, Tamás

Book ID
121547580
Publisher
Springer US
Year
2013
Tongue
English
Weight
293 KB
Volume
17
Category
Article
ISSN
1094-6136

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