By Topic

Makespan Minimization for Two Parallel Machines Scheduling with a Periodic Availability Constraint: The Preemptive Offline Version

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dehua Xu ; Sch. of Math. & Inf. Sci., East China Inst. of Technol., Fuzhou, China ; Meng Qu

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.

Published in:

Computational Science and Optimization (CSO), 2010 Third International Joint Conference on  (Volume:2 )

Date of Conference:

28-31 May 2010