Scheduling with High Variety of Customized Compound Products
DOI:
https://doi.org/10.7494/dmms.2007.1.2.91Keywords:
scheduling, tabu searchAbstract
Domestic appliance is an instance of manufacturing various products on clients demand with frequent changes of production. Although the technological process for each individual product is relatively simply, the variety of products, mixed orders, frequent machines changeovers, machines with unusual service policy, lack or limited storage, etc., generates quite nontrivial planning, batching and scheduling problems and furthermore of a huge size. In this paper, we present speci c real process of production of refrigerators, mathematical and graph models of the problem and an outline of solution algorithm, based the on local search approach.References
Aarts E.H.L. & van Laarhoven P.J.M. (1987). Simulated annealing: A pedestrian review of the theory and some applications. In: Devijver P.A. & Kittler J. (Eds.), Pattern Recognition Theory and Applications. NATO ASI Series, vol. 30, pp. 179–192. Berlin–Heidelberg: Springer. DOI: https://doi.org/10.1007/978-3-642-83069-3_15
Brucker P., Drexl A., Möhring R.H., Neumann K. & Pesch E. (1999). Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research, 112(1), pp. 3–41. DOI: https://doi.org/10.1016/S0377-2217(98)00204-5
Brucker P., Knust S., Schoo A. & Thiele O. (1998). A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 107(2), pp. 272–288. DOI: https://doi.org/10.1016/S0377-2217(97)00335-4
Budyn P. (2007). Scheduling under Frequent Changes of Production Profile [Master’s Thesis]. Wrocław: Institute of Engineering Cybernetics, Wrocław University of Technology.
Glover F. & Laguna M. (1997). Tabu Search. Boston: Kluwer Academic Publishers. DOI: https://doi.org/10.1007/978-1-4615-6089-0
Herroelen W., De Reyck B. & Demeulemeester E. (1998). Resource-constrained project scheduling: A survey of recent developments. Computers & Operations Research, 25(4), pp. 279–302. DOI: https://doi.org/10.1016/S0305-0548(97)00055-5
Kolisch R. & Drexl A. (1997). Local search for nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions, 29(11), pp. 987–999. DOI: https://doi.org/10.1080/07408179708966417
Kolisch R. & Hartmann S. (1999). Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. In: Węglarz J. (Ed.), Project Scheduling: Recent Models, Algorithms and Applications. International Series in Operations Research & Management Science, vol. 14, pp. 147–178. Boston: Kluwer Academic Publishers. DOI: https://doi.org/10.1007/978-1-4615-5533-9_7
Kolisch R. & Padman R. (2001). An integrated survey of deterministic project scheduling. Omega, 29(3), pp. 249–272. DOI: https://doi.org/10.1016/S0305-0483(00)00046-3
Laguna M. & Martí R. (2003). Scatter Search: Methodology and Implementations in C. Boston: Kluwer Academic Publishers. DOI: https://doi.org/10.1007/978-1-4615-0337-8
Mori M. & Tseng C.C. (1997). A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research, 100(1), pp. 134–141. DOI: https://doi.org/10.1016/S0377-2217(96)00180-4
Neumann K., Schwindt C. & Trautmann N. (2003). Advanced production scheduling for batch plants in process industries. In: Günther H.-O. & van Beek P. (Eds.), Advanced Planning and Scheduling Solutions in Process Industry, pp. 43–72. Berlin–Heidelberg: Springer. DOI: https://doi.org/10.1007/978-3-662-05607-3_3
Nowicki E. & Smutnicki C. (1994). A decision support system for the resource constrained project scheduling problem. European Journal of Operational Research, 79(2), pp. 183–195. DOI: https://doi.org/10.1016/0377-2217(94)90350-6
Nowicki E. & Smutnicki C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), pp. 797–813. DOI: https://doi.org/10.1287/mnsc.42.6.797
Nowicki E. & Smutnicki C. (1998). The flow shop with parallel machines: A tabu search approach. European Journal of Operational Research, 106(2–3), pp. 226–253. DOI: https://doi.org/10.1016/S0377-2217(97)00260-9
Nowicki E. & Smutnicki C. (2005). Some new ideas in TS for job shop scheduling. In: Sharda R., Voß S., Rego C. & Alidaee B. (Eds.), Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search. Operations Research/Computer Science Interfaces Series, vol. 30, pp. 165–190. Boston: Springer. DOI: https://doi.org/10.1007/0-387-23667-8_7
Nowicki E. & Smutnicki C. (2005). An advanced tabu search algorithm for the job shop problem. Journal of Scheduling, 8(2), pp. 145–159. DOI: https://doi.org/10.1007/s10951-005-6364-5
Özdamar L. & Ulusoy G. (1996). An iterative local constraints based analysis for solving the resource constrained project scheduling problem. Journal of Operations Management, 14(3), pp. 193–208. DOI: https://doi.org/10.1016/0272-6963(95)00015-1
Salewski F., Schirmer A. & Drexl A. (1997). Project scheduling under resource and mode identity constraints: Model, complexity, methods, and application. European Journal of Operational Research, 102(1), pp. 88–110. DOI: https://doi.org/10.1016/S0377-2217(96)00219-6
Sprecher A. & Drexl A. (1998). Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research, 107(2), pp. 431–450. DOI: https://doi.org/10.1016/S0377-2217(97)00348-2
Thomas P.R. & Salhi S. (1998). A tabu search approach for the resource constrained project scheduling problem. Journal of Heuristics, 4(2), pp. 123–139. DOI: https://doi.org/10.1023/A:1009673512884
