𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Solution of the NP-hard total tardiness minimization problem in scheduling theory

✍ Scribed by A. A. Lazarev

Book ID
110194748
Publisher
SP MAIK Nauka/Interperiodica
Year
2007
Tongue
English
Weight
316 KB
Volume
47
Category
Article
ISSN
0965-5425

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