Simultaneous lot-sizing and scheduling in flexible job shop problems

International Journal of Advanced Manufacturing Technology

Volumn 78, Issue 1-4, 2015, Pages 1-18

  Rohaninejad, Mohammad ^a   Kheirkhah, Amirsaman ^a   Fattahi, Parviz ^a  

^a BU ALI SINA UNIVERSITY   (Iran)

Author keywords

Flexible job shop; Genetic algorithm; Lot sizing; Particle swarm optimization algorithm; Scheduling; Shifting procedure

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PARTICLE SWARM OPTIMIZATION (PSO); PRODUCTION CONTROL; SCHEDULING; SIMULATED ANNEALING; TAGUCHI METHODS;

FLEXIBLE JOB SHOPS; LOT SIZING; LOT-SIZING AND SCHEDULING; MIXED INTEGER PROGRAMMING MODEL; PARTICLE SWARM OPTIMIZATION ALGORITHM; SEQUENCE-DEPENDENT SETUP TIME; SHIFTING PROCEDURE; SIMULATED ANNEALING ALGORITHMS;

JOB SHOP SCHEDULING;

EID: 84916623290     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-014-6598-5     Document Type: Article

References (26)

1. Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365–378
2. Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28:1174–1186
3. Maes J, McClain JO (1991) Multilevel capacitated lot sizing complexity and LP-based heuristics. Eur J Oper Res 53(2):131–148
4. Dellaert N, Jeunet J, Jonard N (2000) A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs. Int J Prod Econ 68:241–257
5. Saidi Mehrabad M, Fattahi P (2007) Flexible job shop scheduling with tabu search algorithms. Int J Adv Manuf Technol 32:563–570
6. Brucker P, Schlie R (1990) Job-shop scheduling with multi-purpose machines. Computing 45:369–375
7. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and job shop scheduling. Math Oper Res 1(2):117–129
8. Fleischmann B (1990) The discrete lot-sizing and scheduling problem. Eur J Oper Res 44:337–348
9. Drexl A, Haase K (1995) Proportional lot-sizing and scheduling. Int J Prod Econ 40:73–87
10. Fleischmann B, Meyr H (1997) The general lotsizing and scheduling problem. OR Spectrum 19:11–21
11. Drexl A, Kimms A (1997) Lot sizing and scheduling-survey and extensions. Eur J Oper Res 99(2):228–49
12. Meyr, H. (2000). Simultaneous lot sizing and scheduling by combining local search with dual reoptimization, European Journal of Operational Research. 120, 311–326
13. Meyr H (2002) Simultaneous lot sizing and scheduling on parallel machines. Eur J Oper Res 139(2):277–292
14. Clark AR, Clark SJ (2000) Rolling-horizon lot-sizing when setup times are sequence-dependent. Int J Prod Res 38(10):2287–2308
15. Haase K, Kimms A (2000) Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. Int J Prod Econ 66:159–169
16. Fandel G, Stammen-Hegene C (2006) Simultaneous lot sizing and scheduling for multi-product multi-level production. Int J Prod Econ 104:308–316
17. Anwar MF, Nagi R (1997) Integrated lot-sizing and scheduling for just-in-time production of complex assemblies with finite set-ups. Int J Prod Res 35:1447–1470
18. Sikora R (1996) A genetic algorithm for integrating lot-sizing and sequencing in scheduling a capacitated flow line. J Comput Ind Eng 30:969–981
19. Lee I, Sikora R, Shaw MJ (1997) A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes. IEEE Tran Sys Man Cybern 27(1):36–54
20. Ponnambalam SG, Mohan Reddy MA (2003) GA-SA multi objective hybrid search algorithm for integrating lot sizing and sequencing in flow-line scheduling. Int J Adv Manuf Technol 21:126–137
21. Palaniappan PLK, Jawahar N (2011) A genetic algorithm for simultaneous optimisation of lot sizing and scheduling in a flow line assembly. Int J Prod Res 49:375–400
22. Almada-Lobo B, James R (2010) Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups. Int J Prod Res 48:861–878
23. Toledo C, Franca¸ P, Morabito R, Kimms A (2009) Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. Int J Prod Res 47:3097–3119
24. James R, Almada-Lobo B (2011) Single and parallel machine capacitated lot-sizing and scheduling: New iterative MIP-based neighborhood search heuristics, Computers & Operations Research
25. Staggemeier AT, Clark AR (2001) A survey of lot-sizing and scheduling models. The Brazilian Operational Research Society
26. Wu CFJ, Hamada MS (2000) Experiments: planning, analysis, and parameter design optimization. Wiley, New York