Abstract
This study deals with an unrelated parallel machine scheduling problem with one additional resource type (e.g., machine operators). The objective is to minimize the total completion time. After giving the integer programming model of the problem, a Lagrangian relaxation problem (LRP) is introduced by relaxing the constraint set concerning the additional resource. A general subgradient optimization procedure is applied to a series of LRPs to maximize the lower bound for the original problem. To generate efficient upper bounds for the original problem, a constraint programming (CP) model is applied by taking the LRP solutions as input regarding the machine assignments. For the problem, a pure CP model is also developed to evaluate its performance. All the solution approaches are evaluated through a range of test problems. The initial computational results show that Lagrangian-based CP approach produces promising results especially for larger problem sizes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blazewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. Operations Research Letters 2(2), 80–83 (1983)
Blazewicz, J., Kubiak, W., Röck, H., Szwarcfiter, J.: Minimizing mean flow time with parallel processors and resource constraints. Acta Informatica 24, 513–524 (1987)
Ventura, J.A., Kim, D.: Parallel machine scheduling about an unrestricted due date and additional resource constraints. IIE Transactions 32, 147–153 (2000)
Kellerer, H., Strusevisch, V.A.: Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research 147, 345–364 (2003)
Kellerer, H., Strusevisch, V.A.: Scheduling problems for parallel dedicated machines under multiple resource constraints. Discrete Applied Mathematics 133, 45–68 (2004)
Kovalyov, M.Y., Shafransky, Y.M.: Uniform machine scheduling of unit-time jobs subject to resource constraints. Discrete Applied Mathematics 84, 253–257 (1998)
Ventura, J.A., Kim, D.: Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints. Computers and Operations Research 30, 1945–1958 (2003)
Edis, E.B., Araz, C., Ozkarahan, I.: Lagrangian-based solution approaches for a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. In: Nguyen, N.T., Borzemski, L., Grzech, A., Ali, M. (eds.) IEA/AIE 2008. LNCS (LNAI), vol. 5027, pp. 337–346. Springer, Heidelberg (2008)
Blazewicz, J., Kubiak, W., Martello, S.: Algorithms for minimizing maximum lateness with unit length tasks and resource constraints. Discrete Applied Mathematics 42, 123–138 (1993)
Kellerer, H., Strusevisch, V.A.: Scheduling parallel dedicated machines with the speeding-up resource. Naval Research Logistics 55(5), 377–389 (2008)
Li, Y., Wang, F., Lim, A.: Resource constraints machine scheduling: A genetic algorithm approach. In: 2003 Congress on Evolutionary Computation, vol. 1-4, pp. 1080–1085 (2003)
Sellmann, M., Fahle, T.: Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research 118, 17–33 (2003)
Darbi-Dowman, K.D., Little, J., Mitra, G., Zaffalon, M.: Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints 1, 245–264 (1997)
Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The progressive party problem: integer linear programming and constraint programming compared. Constraints 1, 119–138 (1997)
Darbi-Dowman, K.D., Little, J.: Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. Informs Journal on Computing 10(3), 276–286 (1998)
Lustig, I.J., Puget, J.F.: Program does not equal program: Constraint programming and its relationship to mathematical programming. Interfaces 31(6), 29–53 (2001)
Edis, E.B., Ozkarahan, I.: A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions. Engineering Optimization 43(2), 135–157 (2011)
Hooker, J.N.: Planning and scheduling to minimize tardiness. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 314–327. Springer, Heidelberg (2005)
IBM, ILOG OPL IDE 6.3., User’s Manual, IBM Corp. (2009)
Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: Proceedings of the Twenty-First International FLAIRS Conference, pp. 555–560 (2008)
IBM, ILOG CPLEX 12.1., User’s Manual, IBM Corp. (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Edis, E.B., Oguz, C. (2011). Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming Approach. In: Achterberg, T., Beck, J.C. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2011. Lecture Notes in Computer Science, vol 6697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21311-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-21311-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21310-6
Online ISBN: 978-3-642-21311-3
eBook Packages: Computer ScienceComputer Science (R0)