Title :
Makespan Minimization for Two Parallel Machines Scheduling with a Periodic Availability Constraint: The Preemptive Offline Version
Author :
Xu, Dehua ; Qu, Meng
Author_Institution :
Sch. of Math. & Inf. Sci., East China Inst. of Technol., Fuzhou, China
Abstract :
We consider the preemptive offline version of the problem "two parallel machines scheduling where one machine is periodically unavailable with non-preemptive jobs and the objective of minimizing the makespan." We propose a polynomial algorithm with time complexity O(n log n) based on the well-known McNaughton\´ Wrap-Around rule for the considered problem.
Keywords :
computational complexity; constraint theory; parallel machines; polynomials; scheduling; McNaughton wrap around rule; makespan minimization; parallel machine scheduling; periodic availability constraint; polynomial algorithm; preemptive offline version; time complexity; Bismuth; Concurrent computing; Constraint optimization; Mathematics; Optimal scheduling; Parallel machines; Polynomials; Processor scheduling; Sufficient conditions; maintenance; makespan; parallel machine; scheduling;
Conference_Titel :
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location :
Huangshan, Anhui
Print_ISBN :
978-1-4244-6812-6
Electronic_ISBN :
978-1-4244-6813-3
DOI :
10.1109/CSO.2010.135
