𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An iterative heuristic for the single machine dynamic total completion time scheduling problem

✍ Scribed by Suresh Chand; Rodney Traub; Reha Uzsoy

Book ID
107950975
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1004 KB
Volume
23
Category
Article
ISSN
0305-0548

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