Total flow time minimization in a flowshop sequence-dependent group scheduling problem

Computers & Operations Research - Tập 37 - Trang 199-212 - 2010
Nasser Salmasi1, Rasaratnam Logendran2, Mohammad Reza Skandari1
1Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran
2School of Mechanical, Industrial and Manufacturing Engineering, Oregon State University, 204 Rogers Hall, Corvallis, OR 97331, USA

Tài liệu tham khảo

Schaller, 2000, Scheduling a flowline manufacturing cell with sequence dependent family setup times, European Journal of Operational Research, 125, 324, 10.1016/S0377-2217(99)00387-2 Pinedo, 2008 Cheng, 2000, A review of flowshop scheduling research with setup times, Production and Operations Management, 9, 262, 10.1111/j.1937-5956.2000.tb00137.x Allahverdi, 1999, A review of scheduling research involving setup considerations, Omega, International Journal of Management Science, 27, 219, 10.1016/S0305-0483(98)00042-5 Zhu, 2006, Scheduling and lot sizing with sequence-dependent setups: a literature review, IIE Transactions, 38, 987, 10.1080/07408170600559706 Allahverdi, 2008, A survey of scheduling problems with setup times or costs, European Journal of Operational Research, 187, 985, 10.1016/j.ejor.2006.06.060 Franca, 2005, Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups, Computers and Industrial Engineering, 20, 1 Logendran, 2006, Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups, Journal of Computers and Operations Research, 33, 158, 10.1016/j.cor.2004.07.004 Hendizadeh, 2008, Meta-heuristics for scheduling a flowshop manufacturing cell with sequence dependent family setup times, International Journal of Production Economics, 111, 593, 10.1016/j.ijpe.2007.02.031 Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, Omega, International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9 Dorigo M. Optimization, learning, and natural algorithms. PhD thesis, Politecnico di Milano; 1992. Dorigo, 1997, Ant colonies for the traveling salesman problem, BioSystems, 43, 73, 10.1016/S0303-2647(97)01708-5 Gajpal, 2006, An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops, International Journal of Production Economics, 101, 259, 10.1016/j.ijpe.2005.01.003 Barnhart, 1998, Branch and price: column generation for solving huge integer programs, Operations Research, 46, 316, 10.1287/opre.46.3.316 Wilhelm, 2001, A technical review of column generation in integer programming, Optimization and Engineering, 2, 159, 10.1023/A:1013141227104 Wilhelm, 2003, Prescribing the content and timing of product upgrade, IIE Transactions, 35, 647, 10.1080/07408170304359 Barnhart, 1995, A column generation and partitioning approach for multi-commodity flow problem, Telecommunication Systems, 3, 239, 10.1007/BF02110307 Desrosiers, 1995, Time constrained routing and scheduling, 10.1016/S0927-0507(05)80106-9 Lubbecke, 2005, Selected topics in column generation, Operations Research, 53, 1007, 10.1287/opre.1050.0234 CPLEX, Release 9.0, ILOG Institute, Paris, France. Salmasi N. Multi-stage group scheduling problems with sequence dependent setups. Doctoral Dissertation, Oregon State University, Corvallis, Oregon; 2005.