IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Computational Science and Opt ... Help

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

Full Text Sign-In or Purchase

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

Page(s):
177 - 181
E-ISBN :
978-1-4244-6813-3
Print ISBN:
978-1-4244-6812-6
INSPEC Accession Number:
11454635
Conference Location :
Huangshan, Anhui
Digital Object Identifier :
10.1109/CSO.2010.135
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.