Makina kullanım kısıtları altında paralel makina çizelgeleme problemi

Within a planning horizon, machines may become unavailable due tounexpected breakdowns or pre-scheduled activities. A realistic approachin constructing the production schedule should explicitly take intoaccount such periods of unavailability. This study addresses the parallelmachine-scheduling problem subject to availability constraints on eachmachine. The objectives of minimizing the total completion time andminimizing the maximum completion time are studied. The problemswith both objectives are known to be NP-hard. We develop an exactbranch-and-bound procedure and propose three heuristic algorithms forthe total completion time problem. Similarly, we propose exact andapproximation algorithms also for the maximum completion timeproblem. All proposed algorithms are tested through extensivecomputational experimentation, and several insights are provided basedon computational results.Keywords: Scheduling, Parallel Machines, Total Completion Time,Makespan, Availability Constraints, Heuristics.