Abstract
This paper studies bi-criteria scheduling problems on m parallel machines with machine unavailable intervals. The goal is to minimize the total completion time subject to the constraint that the makespan is at most a constant T. We study two different unavailability models. In the first model, each machine has a single unavailable interval which starts from time 0. In the second model, each machine can have multiple unavailable intervals, but at any time, there is at most one machine unavailable. For each model, we show that there is an optimal polynomial time algorithm.
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
Chen, C.L., Bulfin, R.L.: Complexity of single machine, multicriteria scheduling problems. European Journal of Operational Research 70, 115–125 (1993)
Dileepan, P., Sen, T.: Bicriteria static scheduling research for a single machine. OMEGA 16, 53–59 (1988)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling, a survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Gupta, J.N.D., Ho, J.C., Webster, S.: Bicriteria optimisation of the makespan and mean flowtime on two identical parallel machines. Journal of Operational Research Society 51(11), 1330–1339 (2000)
Hoogeveen, J.A.: Multicriteria scheduling. European Journal of Operational Research 167(3), 592–623 (2005)
Huo, Y., Zhao, H.: Bicriteria Scheduling Concerned with Makespan and Total Completion Time Subject to Machine Availability Constraints. Theoretical Computer Science 412, 1081–1091 (2011)
Leung, J.Y.-T., Young, G.H.: Minimizing schedule length subject to minimum flow time. SIAM Journal on Computing 18(2), 314–326 (1989)
Leung, J.Y.-T., Pinedo, M.L.: Minimizing total completion time on parallel machines with deadline constraints. SIAM Journal on Computing 32, 1370–1388 (2003)
Leung, J.Y.-T., Pinedo, M.L.: A Note on the scheduling of parallel machines subject to breakdown and repair. Naval Research Logistics 51, 60–72 (2004)
Ma, Y., Chu, C., Zuo, C.: A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering 58(2), 199–211 (2010)
Liu, Z., Sanlaville, E.: Preemptive scheduling with variable profile, precedence constraints and due dates. Discrete Applied Mathematics 58, 253–280 (1995)
Saidy, H., Taghvi-Fard, M.: Study of Scheduling Problems with Machine Availability Constraint. Journal of Industrial and Systems Engineering 1(4), 360–383 (2008)
Schmidt, G.: Scheduling with limited machine availability. European Journal of Operational Research 121(1), 1–15 (2000)
T’kindt, V., Billaut, J.C.: Multicriteria Scheduling: Theory, Models and Algorithms. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huo, Y., Zhao, H. (2013). Bi-criteria Scheduling on Multiple Machines Subject to Machine Availability Constraints. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-38756-2_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38755-5
Online ISBN: 978-3-642-38756-2
eBook Packages: Computer ScienceComputer Science (R0)