𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect

✍ Scribed by Radosław Rudek

Book ID
113440069
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
252 KB
Volume
218
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Strong NP-hardness of the single machine
Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem
✍ C.T. Ng; T.C.E. Cheng; J.J. Yuan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 58 KB

We consider the single machine multi-operation jobs total completion time scheduling problem. Each job consists of several operations that belong to different families. In a schedule, each family of job operations may be processed in batches with each batch incurring a set-up time. A job completes w