Solving production scheduling with earliness/tardiness penalties by constraint programming
- 227 Downloads
This paper deals with an application of constraint programming in production scheduling with earliness and tardiness penalties that reflects the scheduling part of the Just-In-Time inventory strategy. Two scheduling problems are studied, an industrial case study problem of lacquer production scheduling, and also the job-shop scheduling problem with earliness/tardiness costs. The paper presents two algorithms that help the constraint programming solver to find solutions of these complex problems. The first algorithm, called the cost directed initialization, performs a greedy initialization of the search tree. The second one, called the time reversing transformation and designed for lacquer production scheduling, reformulates the problem to be more easily searchable when the default search or the cost directed initialization is used. The conducted experiments, using case study instances and randomly generated problem instances, show that our algorithms outperform generic approaches, and on average give better results than other nontrivial algorithms.
KeywordsProduction scheduling Earliness/tardiness cost Constraint programming
Unable to display preview. Download preview PDF.
- AMETIST (2002). European Community Project IST-2001-35304. Advanced methods for timed systems. http://ametist.cs.utwente.nl/.
- Baptiste, P., Le Pape, C., & Nuijten, W. (1995). Constraint-based optimization and approximation for job-shop scheduling. In: AAAI-SIGMAN Workshop, IJCAI-95.Google Scholar
- 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.
- Beck, J. C., & Perron, L. (2000). Discrepancy-bounded depth first search. In: CP-AI-OR 2000.Google Scholar
- Beck, J. C., & Refalo, P. (2002). Combining local search and linear programming to solve earliness/tardiness scheduling problems. In: CP-AI-OR 2002.Google Scholar
- Behrmann, G., Brinksma, E., Hendriks, M., & Mader, A. (2005). Production scheduling by reachability analysis—a case study. In: WPDRTS 2005. IEEE Computer Society Press.Google Scholar
- Blazewicz J., Ecker K. H., Pesch E., Schmidt G., Werglarz J. (2001) Scheduling computer and manufacturing processes (2nd ed.). Springer-Verlag, BerlinGoogle Scholar
- Carlier J., Pinson E. (1990) A practical use of jackson’s pre-emptive schedule for solving the job-shop problem. Annals of Operations Research 26: 269–287Google Scholar
- 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.Google Scholar
- Harvey, W. D., & Ginsberg, M. L. (1995). Limited discrepancy search. In: IJCAI-95. pp. 607–615.Google Scholar
- ILOG (2002). Ilog OPL Studio 3.6 Language Manual.Google Scholar
- ILOG (2005). Ilog Cplex 9.1 User’s Manual.Google Scholar
- Loeschmann, S., Ludewig, D. (2003). Case study 4: Detailed description of the problem—model of a lacquer production. AMETIST Deliverable 3.4.1.Google Scholar
- Ohno T. (1988) Toyota production system: Beyond large-scale production. Productivity Press, New YorkGoogle Scholar