Parallel machine makespan minimization subject to machine availability and total completion time constraints

In this paper, we study the parallel machine scheduling subject to machine availability constraint. The jobs can be resumed after being preempted by another job or interrupted by the unavailable intervals. The goal is to minimize the makespan subject to the constraint that the total completion time...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling Vol. 22; no. 4; pp. 433 - 447
Main Author: Huo, Yumei
Format: Journal Article
Language:English
Published: New York Springer US 01.08.2019
Springer Nature B.V
Subjects:
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Completion time
Intervals
Job shops
Operations Research/Decision Theory
Optimization
Production scheduling
Supply Chain Management
Parallel machines
Bi-criteria scheduling
Limited machine availability
Makespan
Polynomial time algorithm
Total completion time
ISSN:1094-6136, 1099-1425
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we study the parallel machine scheduling subject to machine availability constraint. The jobs can be resumed after being preempted by another job or interrupted by the unavailable intervals. The goal is to minimize the makespan subject to the constraint that the total completion time is minimized. We study two different machine unavailability models. In the first model, each machine has a single unavailable interval which starts from time 0. In the second model, each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. For each model, we show that there is an optimal polynomial time algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-017-0551-z