Makespan Minimization on Multiple Machines Subject to Machine Unavailability and Total Completion Time Constraints

In this paper, we study the preemptive bi-criteria scheduling problems on m parallel machines with machine unavailable intervals. The goal is to minimize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavai...

Full description

Saved in:
Bibliographic Details
Published inAlgorithmic Aspects in Information and Management pp. 56 - 65
Main Author Huo, Yumei
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2014
SeriesLecture Notes in Computer Science
Online AccessGet full text
ISBN9783319079554
3319079557
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-07956-1_6

Cover

More Information
Summary:In this paper, we study the preemptive bi-criteria scheduling problems on m parallel machines with machine unavailable intervals. The goal is to minimize the makespan subject to the constraint that the total completion time is minimized. We study the model where each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. We show that there is an optimal polynomial time algorithm for this model.
Bibliography:This work is supported by PSC-CUNY Research Award.
ISBN:9783319079554
3319079557
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-07956-1_6