Weitere Artikel dieser Ausgabe durch Wischen aufrufen
This paper addresses the flow shop batching and scheduling problem where sequence-dependent family setup times are present and the objective is to minimize makespan. We consider violating the group technology assumption by dividing product families into batches. In order to reduce setup times, inconsistent batches are formed on different machines, which lead to non-permutation schedules. To the best of our knowledge, this is the first time that the splitting of job families into inconsistent batches has been considered in a flow shop system. A tabu search algorithm is developed which contains several neighbourhood functions, double tabu lists and a multilevel diversification structure. Compared to the state-of-the-art meta-heuristics for this problem, the proposed tabu search algorithm achieves further improvement when the group scheduling assumption is dropped. Also, various experiments conducted on the benchmark problem instances confirm the benefits of batching. Therefore, it will be prudent for the practitioners to consider adopting inconsistent batches and non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Allahverdi, A., Gupta, J., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega International Journal of Management Science, 27, 219–239. CrossRef
Allahverdi, A., Ng, C., Cheng, T., & Kovalyov, Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187, 985–1032. CrossRef
Angel-Bello, F., Alvarez, A., Pacheco, J., & Martnez, I. (2011a). A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times. Computers and Mathematics with Applications, 61, 797–808. CrossRef
Angel-Bello, F., Alvarez, A., Pacheco, J., & Martnez, I. (2011b). A single machine scheduling problem with availability constraints and sequence-dependent setup costs. Applied Mathematical Modelling, 35, 2041–2050. CrossRef
Battiti, R., & Giampietro, T. (1994). The reactive tabu search. ORSA Journal on Computing, 6(2), 126–140. CrossRef
Buscher, U., & Shen, L. (2009). An integrated tabu search algorithm for the lot streaming problem in job shops. European Journal of Operational Research, 199, 385–399. CrossRef
Campbell, H., Dudek, R., & Simth, M. (1970). A heuristic algorithm for the n job m machine sequencing problem. Management Science, 16(10), B630–B637. CrossRef
Cheng, T., Gupta, J., & Wang, G. (2000). A review of flowshop scheduling research with setup times. Production and Operations Management, 9, 262–282. CrossRef
Franca, P., Gupta, J., Mendes, A., Moscato, P., & Veltink, K. (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups. Computers and Industrial Engineering, 48, 491–506. CrossRef
Frazier, G. (1996). An evaluation of group scheduling heuristics in a flow-line manufacturing cell. International Journal of Production Research, 34(4), 959–976. CrossRef
Gupta, J. (1979). A review of flowshop scheduling research. In Disaggregation problems in manufacturing and service organizations (pp. 363–388). The Hague: Martin Nijhoff.
Gupta, J., & Darrow, W. (1986). The two-machine sequence dependent flowshop scheduling problem. European Journal of Operational Research, 24, 439–446. CrossRef
Gupta, J., & Stafford, E. F. (2006). Flowshop scheduling research after five decades. European Journal of Operational Research, 169, 699–711. CrossRef
Hendizadeh, S., Faramarzi, H., Mansouri, S., Gupta, J., & Eimekkawy, T. (2008). Mata-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times. International Journal of Production Economics, 111, 593–605. CrossRef
Lin, S., Gupta, J., Ying, K. & Lee, Z. (2009). Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times. International Journal of Production Research, 47, 3205–3217.
Lin, S., Ying, K., & Lee, Z. (2009). Metaheuristics for scheduling a non-permutation flowshop manufacturing cell with sequence dependent family setup times. Computers and Operations Research, 36, 1110–1121. CrossRef
Logendran, R., de Szoeke, P., & Barnard, F. (2006). Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102, 66–86. CrossRef
Monma, C., & Potts, C. (1989). On the complexity of scheduling with batch setups. Operations Research, 37, 798–804. CrossRef
Mosheiov, G., Oron, D., & Ritov, Y. (2004). Flow-shop batching scheduling with identical processing-time jobs. Naval Research Logistics, 51, 783–799. CrossRef
Nawaz, M., Enscore, E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA International Journal of Management Science, 11, 91–95.
Nowicki, E., & Smutnicki, C. (1996). A fast taboo search algorithm for the job shop problem. Management Science, 42(6), 797–813.
Pacheco, J., Angel-Bello, F., Alvarez, A. (2013). A multi-start tabu search method for a single machine scheduling problem with periodic maintenance and sequence-dependent setup times. Journal of Scheduling, 16(6), 661–673. doi: 10.1007/s10951-012-0280-2.
Reddy, V., & Narendran, T. (2003). Heuristics for scheduling sequence-dependent set-up jobs in flow line cells. International Journal of Production Research, 41, 193–206. CrossRef
Ruben, R., Mosier, C., & Mahmoodi, F. (1993). A comprehensive analysis of group scheduling heuristics in a job shop cell. International Journal of Production Research, 31, 1343–1369. CrossRef
Schaller, J., Gupta, J., & Vakharia, A. (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125, 324–339. CrossRef
Shen, L., Mönch, L., Buscher, U. (2013a). A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups. Journal of Scheduling. doi: 10.1007/s10951-013-0315-3.
Shen, L., Mönch, L., Buscher, U. (2013b). An iterative approach for the serial batching problem with parallel machines and job families. Annals of Operations Research, 206(1), 425–448. doi: 10.1007/s10479-013-1339-y.
Ying, K., Gupta, J., Lin, S. & Lee, Z. (2010). Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups. International Journal of Production Research, 48(8), 2169–2184.
Ying, K., Lin, S., & Lee, Z. (2012). Metaheuristics for scheduling a no-wait flowshop manufacturing cell with sequence dependent family setups. International Journal of Advanced Manufacturing Technology, 58, 671–682. CrossRef
- Flow shop batching and scheduling with sequence-dependent setup times
Jatinder N. D. Gupta
- Springer US
Neuer Inhalt/© Stellmach, Neuer Inhalt/© BBL, Neuer Inhalt/© Maturus, Pluta Logo/© Pluta, Neuer Inhalt/© hww, digitale Transformation/© Maksym Yemelyanov | Fotolia