Abstract
Recently, a variety of constraint programming and Boolean satisfiability approaches to scheduling problems have been introduced. They have in common the use of relatively simple propagation mechanisms and an adaptive way to focus on the most constrained part of the problem. In some cases, these methods compare favorably to more classical constraint programming methods relying on propagation algorithms for global unary or cumulative resource constraints and dedicated search heuristics. In particular, we described an approach that combines restarting, with a generic adaptive heuristic and solution guided branching on a simple model based on a decomposition of disjunctive constraints.
In this paper, we introduce an adaptation of this technique for an important subclass of job shop scheduling problems (JSPs), where the objective function involves minimization of earliness/tardiness costs. We further show that our technique can be improved by adding domain specific information for one variant of the JSP (involving time lag constraints). In particular we introduce a dedicated greedy heuristic, and an improved model for the case where the maximal time lag is 0 (also referred to as no-wait JSPs).
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
Artigues, C., Huguet, M.-J., Lopez, P.: Generalized Disjunctive Constraint Propagation for Solving the Job Shop Problem with Time Lags. EAAI 24(2), 220–231 (2011)
Baptiste, P., Flamini, M., Sourd, F.: Lagrangian Bounds for Just-in-Time Job-shop Scheduling. Computers & OR 35(3), 906–915 (2008)
Beck, J.C.: Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling. JAIR 29, 49–77 (2007)
Beck, J.C., Refalo, P.: A Hybrid Approach to Scheduling with Earliness and Tardiness Costs. Annals OR 118(1-4), 49–71 (2003)
Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting Systematic Search by Weighting Constraints. In: ECAI, pp. 482–486 (2004)
Bozejko, W., Makuchowski, M.: A Fast Hybrid Tabu Search Algorithm for the No-wait Job Shop Problem. Computers & Industrial Engineering 56(4), 1502–1509 (2009)
Caumond, A., Lacomme, P., Tchernev, N.: A Memetic Algorithm for the Job-shop with Time-lags. Computers & OR 35(7), 2331–2356 (2008)
Danna, E., Perron, L.: Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. Technical report, ILOG (2003)
Danna, E., Rothberg, E., Le Pape, C.: Integrating Mixed Integer Programming and Local Search: A Case Study on Job-Shop Scheduling Problems. In: CPAIOR (2003)
Feydy, T., Stuckey, P.J.: Lazy Clause Generation Reengineered. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 352–366. Springer, Heidelberg (2009)
Grimes, D.: A Study of Adaptive Restarting Strategies for Solving Constraint Satisfaction Problems. In: AICS (2008)
Grimes, D., Hebrard, E.: Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 147–161. Springer, Heidelberg (2010)
Grimes, D., Hebrard, E., Malapert, A.: Closing the Open Shop: Contradicting Conventional Wisdom. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 400–408. Springer, Heidelberg (2009)
Kelbel, J., Hanzálek, Z.: Solving production scheduling with earliness/tardiness penalties by constraint programming. J. Intell. Manuf. (2010)
Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Nogood Recording from Restarts. In: IJCAI, pp. 131–136 (2007)
Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. In: ISTCS, pp. 128–133 (1993)
Mascis, A., Pacciarelli, D.: Job-shop Scheduling with Blocking and No-wait Constraints. EJOR 143(3), 498–517 (2002)
Morton, T.E., Pentico, D.W.: Heuristic Scheduling Systems. John Wiley and Sons, Chichester (1993)
Rajendran, C.: A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan. The Journal of the Operational Research Society 45(4), 472–478 (1994)
Schuster, C.J.: No-wait Job Shop Scheduling: Tabu Search and Complexity of Problems. Math. Meth. Oper. Res. 63, 473–491 (2006)
Schutt, A., Feydy, T., Stuckey, P.J., Wallace, M.: Why Cumulative Decomposition Is Not as Bad as It Sounds. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 746–761. Springer, Heidelberg (2009)
Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling Finite Linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 590–603. Springer, Heidelberg (2006)
Vázquez, M., Whitley, L.D.: A comparison of genetic algorithms for the dynamic job shop scheduling problem. In: GECCO, p. 1011 (2000)
Vilím, P.: Filtering Algorithms for the Unary Resource Constraint. Archives of Control Sciences 18(2) (2008)
Walsh, T.: Search in a Small World. In: IJCAI, pp. 1172–1177 (1999)
Watson, J.-P., Barbulescu, L., Howe, A.E., Whitley, L.D.: Algorithm performance and problem structure for flow-shop scheduling. In: AAAI, pp. 688–695 (1999)
Wismer, D.A.: Solution of the Flowshop-Scheduling Problem with No Intermediate Queues. Operations Research 20(3), 689–697 (1972)
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
Grimes, D., Hebrard, E. (2011). Models and Strategies for Variants of the Job Shop Scheduling Problem. In: Lee, J. (eds) Principles and Practice of Constraint Programming – CP 2011. CP 2011. Lecture Notes in Computer Science, vol 6876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23786-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-23786-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23785-0
Online ISBN: 978-3-642-23786-7
eBook Packages: Computer ScienceComputer Science (R0)