𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity and approximability of scheduling resumable proportionally deteriorating jobs

✍ Scribed by Stanisław Gawiejnowicz; Alexander Kononov

Book ID
108118667
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
187 KB
Volume
200
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for single
A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
✍ Theodore G. Voutsinas; Costas P. Pappis 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Scheduling deteriorating jobs is an area of research which has attracted much attention recently. In this paper the problem of single machine scheduling, where the values of jobs remaining after processing deteriorate over time, is presented. A branch and bound method is developed, which, using the