Solving production scheduling with earliness/tardiness penalties by constraint programming

Journal of Intelligent Manufacturing

Volumn 22, Issue 4, 2011, Pages 553-562

  Kelbel, Jan ^a   Hanzálek, Zdeněk ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Constraint programming; Earliness tardiness cost; Production scheduling

Indexed keywords

COMPLEX PROBLEMS; CONSTRAINT PROGRAMMING; EARLINESS AND TARDINESS PENALTIES; EARLINESS/TARDINESS; EARLINESS/TARDINESS PENALTIES; GENERIC APPROACH; INDUSTRIAL CASE STUDY; INVENTORY STRATEGIES; JOB SHOP SCHEDULING PROBLEMS; JUST IN TIME; LACQUER PRODUCTION; NON-TRIVIAL ALGORITHMS; PROBLEM INSTANCES; PRODUCTION SCHEDULING; SCHEDULING PROBLEM; SEARCH TREES;

ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; COSTS; INDUSTRIAL APPLICATIONS; LACQUERS; PRODUCTION ENGINEERING; PROTECTIVE COATINGS; TREES (MATHEMATICS);

JUST IN TIME PRODUCTION;

EID: 80053383675     PISSN: 09565515     EISSN: 15728145     Source Type: Journal    
DOI: 10.1007/s10845-009-0318-2     Document Type: Article

References (25)

1. AMETIST (2002). European Community Project IST-2001-35304. Advanced methods for timed systems. http://ametist.cs.utwente.nl/.
2. Baker, K. R., & Scudder, G. D. (1990). Sequencing with earliness and tardiness penalties: A review. Operations Research, 38(1) 22-36.
3. Baptiste, P., Le Pape, C., & Nuijten, W. (1995). Constraint-based optimization and approximation for job-shop scheduling. In: AAAISIGMAN Workshop, IJCAI-95.
4. Barták, R., Salido, M. A., & Rossi, F. (2009). Constraint satisfaction techniques in planning and scheduling. Journal of Intelligent Manufacturing. doi:10.1007/s10845-008-0203-4.
5. Beck, J. C., & Perron, L. (2000). Discrepancy-bounded depth first search. In: CP-AI-OR 2000.
6. Beck, J. C., & Refalo, P. (2002). Combining local search and linear programming to solve earliness/tardiness scheduling problems. In: CP-AI-OR 2002.
7. Beck, J. C., & Refalo, P. (2003). A hybrid approach to scheduling with earliness and tardiness costs. Annals of Operations Research, 118(1-4), 49-71.
8. Behrmann, G., Brinksma, E., Hendriks, M., & Mader, A. (2005). Production scheduling by reachability analysis-a case study. In: WPDRTS 2005. IEEE Computer Society Press.
9. Blazewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & Werglarz, J. (2001). Scheduling computer and manufacturing processes (2nd ed.). Berlin: Springer-Verlag.
10. Carlier, J., & Pinson, E. (1990). A practical use of jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research, 26, 269-287.
11. Danna, E., & Perron, L. (2003). Structured vs. unstructured large neighborhood search: A case study on job-shop scheduling problems with earliness and tardiness costs. In: CP 2003. pp. 817-821.
12. Danna, E., Rothberg, E., & Le Pape, C. (2005). Exploring relaxation induced neighborhoods to improve MIP solution. Mathematical Programming, 102(1), 71-90. (Pubitemid 40134692)
13. Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483-495.
14. El Sakkout, H., &Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4), 359-388.
15. Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In: IJCAI-95. pp. 607-615.
16. Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operations Research, 167(3), 592-623. (Pubitemid 40220081)
17. ILOG (2002). Ilog OPL Studio 3.6 Language Manual.
18. ILOG (2005). Ilog Cplex 9.1 User's Manual.
19. Laborie, P. (2003). Algorithm for propagating resource constraints in AI planning and scheduling: Existing approaches and new results. Artificial Intelligence, 143(2), 151-188.
20. Loeschmann, S., Ludewig, D. (2003). Case study 4: Detailed description of the problem-model of a lacquer production. AMETIST Deliverable 3.4.1.
21. Luh, P. B., et al. (1998). Job shop scheduling with group-dependent setups, finite buffers, and long time horizon. Annals ofOperations Research, 78, 233-259. (Pubitemid 128405205)
22. Mercier, L., & Van Hentenryck, P. (2008). Edge finding for cumulative scheduling. Informs Journal on Computing, 20(1), 143-153.
23. Nuijten, W., & Aarts, E. (1996). A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research, 90(2), 269-284. (Pubitemid 126652214)
24. Ohno, T. (1988). Toyota production system: Beyond large-scale production. New York: Productivity Press.
25. Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285. (Pubitemid 23599340)