✦ LIBER ✦

On the complexity of coupled-task scheduling

✍ Scribed by A.J. Orman; C.N. Potts

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 873 KB
Volume: 72
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(96)00041-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of scheduling tasks wi

On the complexity of scheduling tasks with discrete starting times

✍ J Mark Keil 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 210 KB

On the parametric complexity of schedule

On the parametric complexity of schedules to minimize tardy tasks

✍ Michael R. Fellows; Catherine McCartin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 121 KB

On the complexity of task allocation

✍ A. Schoneveld; J. F. de Ronde; P. M. A. Sloot 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 3 views

A detailed study is presented on the combinatorial optimization problem of allocating parallel tasks to a parallel computer. Depending on two application/machine-specific parameters, both a sequential and a parallel optimal allocation phase are shown to exist. A sudden "phase" transition is observed

On the complexity of manpower shift sche

On the complexity of manpower shift scheduling

✍ Hoong Chuin Lau 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 734 KB

Coupled-task scheduling on a single mach

Coupled-task scheduling on a single machine subject to a fixed-job-sequence

✍ F.J. Hwang; Bertrand M.T. Lin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 923 KB

This paper investigates single-machine coupled-task scheduling where each job has two tasks separated by an exact delay. The objective of this study is to schedule the tasks to minimize the makespan subject to a given job sequence. We introduce several intriguing properties of the fixed-job-sequence

On the complexity of preemptive openshop

On the complexity of preemptive openshop scheduling problems

✍ C. Sriskandarajah; E. Wagneur 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB