Abstract
This paper is about multi-processor scheduling with non idling constraints, i.e. constraints which forbid interruption in the use of the processors. We first reformulate the problem, while using a notion of pyramidal shape, and next apply matching techniques in order to get a min-max feasibility characterization criterion, which allows us to derive a polynomial algorithm for the related existence problem and for the Makespan Minimization related problem. The last part of the paper is devoted to the Linear Cost Minimization of multiprocessor scheduling with non idling constraints, which we handle through linear model and a heuristic Lagrangean decomposition approach, and involves numerical experiments.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baptiste, P.: Scheduling unit tasks to minimize the number of idle periods: a polynomial time algorithm for off-line dynamic power management; Research Report, Laboratoire d Informatique CNRS LIX (2005)
Chretienne, P.: On single-machine scheduling without intermediate delays. Discrete Applied Maths 13-156, 2543–2550 (2008)
Jouglet, A.: Single-machine scheduling with no-idle time and release dates to minimize a regular criterion. Journal of Scheduling 15(2), 217–238 (2012)
Valente, J.M.S., Alves, R.A.F.S.: An exact approach to early/tardy scheduling with release dates. Computers and Operations Research 32, 2905–2917 (2005)
Landis, K.: Group technology and cellular manufacturing in the Westvaco Los Angeles VH Department, Project Report in IOM 581, School of Business, University of Southern California (1983)
Irani, S., Pruhs, K.: Algorithmic problems in power management, vol. 36, pp. 63–76. ACM Press, New York (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Quilliot, A., Chretienne, P., Bernay, B. (2013). Homogeneous Non Idling Problems: Models and Algorithms. In: Fidanova, S. (eds) Recent Advances in Computational Optimization. Studies in Computational Intelligence, vol 470. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00410-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-00410-5_7
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00409-9
Online ISBN: 978-3-319-00410-5
eBook Packages: EngineeringEngineering (R0)