𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Scheduling multi‐operation jobs on a single machine

✍ Scribed by A.E. Gerodimos; C.A. Glass; C.N. Potts; T. Tautenhahn

Book ID
110380126
Publisher
Springer US
Year
1999
Tongue
English
Weight
181 KB
Volume
92
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scheduling maintenance and semiresumable
Scheduling maintenance and semiresumable jobs on a single machine
✍ Gregory H. Graves; Chung-Yee Lee 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 1 views

The majority of scheduling literature assumes that the machines are available at all times. In this paper, we study single machine scheduling problems where the machine maintenance must be performed within certain intervals and hence the machine is not available during the maintenance periods. We al

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