Two meta-heuristics for solving a new two-machine flowshop scheduling problem with the learning effect and dynamic arrivals

International Journal of Advanced Manufacturing Technology

Volumn 65, Issue 5-8, 2013, Pages 771-786

  Hosseini, N ^a   Tavakkoli Moghaddam, R ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

Dynamic arrivals; Genetic algorithm; Learning effect; Simulated annealing; Time window; Two machine flowshop scheduling

Indexed keywords

GENETIC ALGORITHMS; JOB SHOP SCHEDULING; SCHEDULING; SIMULATED ANNEALING;

COMPUTATIONAL RESULTS; LEARNING EFFECTS; META HEURISTICS; MULTI-OBJECTIVE GENETIC ALGORITHM; NEW MATHEMATICAL MODEL; POSITION DEPENDENTS; TIME WINDOWS; TWO-MACHINE FLOWSHOP;

PROBLEM SOLVING;

EID: 84861334422     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-012-4216-y     Document Type: Article

References (31)

1. Lee CY (1991) Earliness–tardiness scheduling problems with constant size of due date window. Research Report No. 91-17. Industrial and Systems Engineering Department, University of Florida, Gainesville
2. Anger FD, Lee CY, Martin-Vega LA (1986) Single machine scheduling with tight windows. Report No. 86-16. Industrial and Systems Engineering Department, University of Florida, Gainesville
3. Sung CS, Min JI (2001) Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date. Eur J Oper Res 131:95–106
4. Yeung WK, Oguz C, Edwin Cheng TC (2003) Two-stage flow shop earliness and tardiness machine scheduling involving a common due window. Int J Prod Econ 90:421–434
5. Gupta J, Lauff V, Werne F (2004) Two-machine flow shop scheduling with nonregular criteria. J Math Model Algorithm 3:123–151
6. Sakuraba CS, Ronconi DP, Sourd F (2007) Scheduling in a two-machine flow shop for the minimization of the mean absolute deviation from a common due date. Comput Oper Res 36:60–72
7. Tavakkoli-Moghaddam R, Rahimi-Vahed A, Mirzaei AH (2007) A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness. Inf Sci 177:5072–5090
8. Mirsane HS, Zandieh M, Moayed MJ, Khabbazi MR (2009) A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup time. J Intell Manuf 22(6):965–978
9. Khaloui S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a JIT scheduling problem in hybrid flowshop. Eng Appl Artif Intell 23:765–771
10. Naderi B, Tavakkoli-Moghaddam R, Khalili MC (2010) Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan. Knowl Base Syst 23:77–85
11. Eren T, Guner E (2006) Minimizing total tardiness in a scheduling problem with a learning effect. Appl Math Model 31:1351–1361
12. Eren T, Guner E (2007) A bicriteria flowshop scheduling with a learning effect. Appl Math Model 32:1719–1733
13. Sung CS, Kim YK (2000) Minimizing makespan in a two-machine flow shop with dynamic arrivals allowed. Comput Oper Res 29:275–294
14. Sung CS, Choung YI, Hong JM, Kim YH (2002) Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals. Comput Oper Res 29:995–1007
15. Hatami S, Ebrahimnejad S, Tavakkoli-Moghaddam R, Maboudian Y (2010) Two meta-heuristics for three-stage assembly flowshop scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 50:1153–1164
16. Tavakkoli-Moghaddam R, Rahimi-Vahed AR, Mirzaei AH (2008) Solving a multi objective no-wait flow shop scheduling problem with an immune algorithm. Int J Adv Manuf Technol 36:969–981
17. Mansouri SA, Hendizadeh SH, Salmasi N (2009) Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times. Int J Adv Manuf Technol 40:1216–1226
18. Ziaeifar A, Tavakkoli-Moghaddam R, Pichka K (2011) Solving a new mathematical model for a hybrid flow shop scheduling problem with a processor assignment by a genetic algorithm. Int J Adv Manuf Technol. doi:10.1007/s00170-011-3701-z
19. Tavakkoli-Moghaddam R, Azarkish M, Sadeghnejad-Barkousaraie A (2011) Solving a multi-objective job shop scheduling problem with sequence-dependent setup times by a Pareto archive PSO combined with genetic operators and VNS. Int J Adv Manuf Technol 53:733–750
20. Whitley D (1992) A genetic algorithm tutorial. Computer Science Department, Colorado State University, Fort Collins
21. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor
22. DeJong K (1975) An analysis of the behavior of a class of genetic adaptive systems. PhD Dissertation. Dept. of Computer and Communication Sciences, University of Michigan, Ann Arbor
23. Reeves CR, Rown JE (2002) Genetic algoritms principles and perspectives. Kluwer, Norwell
24. Gutjahr AL, Nemhauser GL (1964) An algorithm for the line balancing problem. Manag Sci 11(2):308–315
25. Lapierre SD, Ruiz A, Soriano P (2006) Balancing assembly lines with tabu search. Eur J Oper Res 168(3):826–837
26. Suresh G, Sahu S (1994) Stochastic assembly line balancing using simulated annealing. Int J Prod Res 32(8):1801–1810
27. Jackman J, Schmidt LC (1995) Evaluating assembly sequences for automatic assembly system. IIE Trans 27(1):23–31
28. Vilarinho PM, Simaria AS (2002) A two-stage heuristic method for balancing mixed-model assembly lines with parallel work stations. Int J Prod Res 40(6):1405–1420
29. Seyed-Alagheband SA, Fatemi Ghomi SMT, Zandieh M (2011) A simulated annealing algorithm for balancing the assembly line type II problem with sequence-dependent setup times between tasks. Int J Prod Res 49:805–825
30. İşler MC, Toklu B, Çelik V (2011) Scheduling in a two-machine flow-shop for earliness/tardiness under learning effect. Int J Adv Manuf Technol 1–9
31. Lee WC, Wu CC (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88:85–93