Parallel machine scheduling subject to machine availability constraints
Author
Sevindik, Kaya
Advisor
Taner, Mehmet Rüştü
Date
2006Publisher
Bilkent University
Language
English
Type
ThesisItem Usage Stats
101
views
views
43
downloads
downloads
Abstract
Within a planning horizon, machines may become unavailable due to
unexpected breakdowns or pre-scheduled activities. A realistic approach
in constructing the production schedule should explicitly take into
account such periods of unavailability. This study addresses the parallel
machine-scheduling problem subject to availability constraints on each
machine. The objectives of minimizing the total completion time and
minimizing the maximum completion time are studied. The problems
with both objectives are known to be NP-hard. We develop an exact
branch-and-bound procedure and propose three heuristic algorithms for
the total completion time problem. Similarly, we propose exact and
approximation algorithms also for the maximum completion time
problem. All proposed algorithms are tested through extensive
computational experimentation, and several insights are provided based
on computational results.
Keywords
SchedulingParallel Machines
Total Completion Time
Makespan
Availability Constraints
Heuristics