Abstract
The job sequencing problem for a single machine withsequence-dependent setups is solved using the constraint programing (CP) and mixed-integer programming (MIP) approaches. For the CP search, ten different variable and value ordering heuristics are tested using both the CP model and/or the combined model of the MIP and CP formulations. Some of these heuristics exploit problem specific data like setup cost and due date. Others rely on hybrid strategies that use the linear programming (LP) solver within the CP search or direct the search using the initial feasible solution obtained from the MIP model. A coparative analysis of the search heuristics and the CP and MIP solvers has been give n with respect to the solution times. The research results indicate that the CP solver finds the optimum solution in a very short time compared to the MIP solver as the number of jobs to be scheduled increases.
This research project has been partially supported by the Dokuz Eylul University under research project # 0922.01.01.04.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Monma, C.L., Potts, C.N.: On the Complexity of Scheduling with Batch Setup Times. Operations Research 37, 798–804 (1989)
Darby-Dowman, K., 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, 276–286 (1998)
Hajunkoski, I., Jain, V., Grossmann, I.E.: Hybrid Mixed-Integer/Constraint Logic Programming Strategies for Solving Scheduling and Combinatorial Optimization Problems. Computers and Chemical Engineering 24, 337–343 (2000)
Mackworth, A.K.: Consistency in Networks of Relations. Artificial Intelligence 8, 99–118 (1977)
Puget, J.F., Lustig, I.: Constraint Programming and Maths Programming. The Knowledge Engineering Review 16, 5–23 (2001)
Jordan, C., Drexl, A.: A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups. ORSA Journal on Computing 7, 160–165 (1995)
Brandimarte, P., Villa, A.: Advanced Models for Manufacturing Systems Management. CRC Press, Boca Raton (1995)
Little, J.: Enhancing the Performance of Constraint Programming through the Introduction of Linear Programming. Journal of the Operational Research Society 52, 82–92 (2001)
ILOG OPL Studio 3.5: Language Manual. ILOG SA, Gentilly, France (2001)
Jordan, C.: Batching & Scheduling: Models and Methods for Several Problem Classes. Ph.D. Thesis, Christian-Albrechts University (1996)
Smith, B.M., Brailsford, S.C., Hubbard, P.M., Williams, H.P.: The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared. Constraints, An International Journal 1(1/2), 119–138 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Topaloglu, S., Ozkarahan, I. (2004). Comparison of Different Variable and Value Order Strategies for the Optimum Solution of a Single Machine Scheduling Problem with Sequence-Dependent Setups. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_100
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive