An integrated neural network-simulation algorithm for performance optimisation of the bi-criteria two-stage assembly flow-shop scheduling problem with stochastic activities

International Journal of Production Research

Volumn 50, Issue 24, 2012, Pages 7271-7284

  Azadeh, A ^a   Jeihoonian, M ^a   Shoja, B Maleki ^a   Seyedmahmoudi, S H ^a  

^a UNIVERSITY OF TEHRAN   (Iran)

Author keywords

scheduling; simulation applications

Indexed keywords

BI-CRITERIA; DECISION MAKERS; FLOW SHOP SCHEDULING PROBLEM; JOB SCHEDULING; MAKESPAN; MEAN COMPLETION TIME; META MODEL; MULTILAYERED NEURAL NETWORKS; OBJECTIVE FUNCTION VALUES; ON-MACHINES; OPTIMUM VALUE; PERFORMANCE OPTIMISATION; PROCESSING TIME; RUNTIMES; SET-UP TIME; SIMULATION APPLICATIONS; SIMULATION MODEL; SIMULATION SOFTWARE; STOCHASTIC MACHINE BREAKDOWN; VISUAL SLAM; WEIGHTED SUM;

COMPUTER SIMULATION; MATHEMATICAL MODELS; NEURAL NETWORKS; SCHEDULING; SCHEDULING ALGORITHMS; STOCHASTIC SYSTEMS;

COMPUTER SOFTWARE;

EID: 84868682252     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.645511     Document Type: Article

References (47)

1. Alcaide, A, Rodriguez-Gonzalez, A, and, Sicilia, J. 2002. An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns. European Journal of Operational Research, 140 (2): 384-398. (Pubitemid 34435040)
2. Alfieri, A. 2009. Workload simulation and optimization in multi-criteria hybrid flowshop scheduling: a case study. International Journal of Production Research, 47 (18): 5129-5145.
3. Allahverdi, A. 2003. The two- and m -machine flowshop scheduling problems with bicriteria of makespan and mean flowtime. European Journal of Operational Research, 147 (2): 373-396.
4. Allahverdi, A, and, Al-Anzi, FS. 2006. Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research, 44 (22): 4713-4735. (Pubitemid 44536479)
5. Allahverdi, A, and, Al-Anzi, FS. 2007. The two-stage assembly flow shop scheduling problem with bicriteria of makespan and mean completion time. International Journal of Advanced Manufacturing Technology, 37 (1): 166-177.
6. Allahverdi, A, and, Al-Anzi, FS. 2008. The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time. The International Journal of Advanced Manufacturing Technology, 37 (1/2): 166-177. (Pubitemid 351651608)
7. Allahverdi, A, and, Tatari, MF. 1996. Simulation of different rules in stochastic flowshops. Computers and Industrial Engineering, 31 (1/2): 209-212. (Pubitemid 126380020)
8. Allaoui, H, and, Artiba, A. 2004. Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers and Industrial Engineering, 47 (4): 431-450.
9. Azadeh, MA, Karimizad, K, and, Shakeri, SH. 2000. Using computer simulation in a heavy electromotors assembly line unit. Journal of Faculty Engineering, University of Tehran, 34 (2): 127-139.
10. Azadeh, A. 2010a. A flexible artificial neural network-fuzzy simulation algorithm for scheduling a flowshop with multiple processors. International Journal of Advanced Manufacturing Technology, 50 (5-8): 699-715.
11. Azadeh, A. 2010b. Integration of simulation, design of experiment and goal programming for minimization of makespan and tardiness. International Journal of Advanced Manufacturing, 46 (5-8): 431-444.
12. Boudhar, M, and, Meziani, N. 2009. Two-stage hybrid flow shop with recirculation. International Transactions in Operational Research, 17 (2): 239-255.
13. Braglia, M, and, Grassi, A. 2009. A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness. International Journal of Production Research, 47 (1): 273-288.
14. Caffrey, J, and, Hitchings, G. 1995. Makespan distributions in flow shop scheduling. International Journal of Operations & Production Management, 15 (3): 50-58. (Pubitemid 39032494)
15. Chan, FTS, Wong, TC, and, Chan, LY. 2009. An evolutionary algorithm for assembly job shop with part sharing. Computers and Industrial Engineering, 57 (3): 641-651.
16. Cheng, TCE, and, Wang, G. 1999. Scheduling the fabrication and assembly of components in a two-machine flowshop. IIE Transactions, 31 (2): 135-443.
17. Grangeon, N, Tanguy, A, and, Tchernev, N. 1999. Generic simulation model for hybrid flow shop. Computers and Industrial Engineering, 137 (1/2): 207-210.
18. Gupta, JND, Hariri, AMA, and, Potts, CN. 1997. Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research, 69 (0): 171-191. (Pubitemid 127503103)
19. Kalczynski, PJ, and, Kamburowski, J. 2006. A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation. European Journal of Operational Research, 169 (3): 742-750. (Pubitemid 41492012)
20. Koulamas, C, and, Kyparisis, GJ. 2000. Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops. Naval Research Logistics, 47 (3): 259-268.
21. Koulamas, C, and, Kyparisis, GJ. 2001. The three stage assembly flowshop scheduling problem. Computers and Operations Research, 28 (7): 689-704. (Pubitemid 32379144)
22. Lee, CY, Cheng, TCE, and, Lin, BMT. 1993. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science, 39 (5): 616-625. (Pubitemid 23710442)
23. Low, C, Hsu, CJ, and, Su, CT. 2008. A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines. Computers and Operations Research, 35 (3): 845-853. (Pubitemid 47368842)
24. Manjeshwar, PK, Damodaran, P, and, Srihari, K. 2009. Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing. Robotics and Computer-Integrated Manufacturing, 25 (3): 667-679.
25. Onwubolu, GC. 1996. A flow-shop manufacturing scheduling system with interactive computer graphics. International Journal of Operations & Production Management, 16 (9): 74-84.
26. Potts, CN. 1995. The two-stage assembly scheduling problem: complexity and approximation. Operations Research, 43 (2): 346-355.
27. Pritsker, AAB, and, OReilly, JJ. 1999. Simulation with Visual SLAM and AweSim, New York: Wiley.
28. Rajendran, C. 1995. Heuristics for scheduling in flowshop with multiple objectives. European Journal of Operational Research, 82 (3): 540-555.
29. Ruiz, R, and, Vázquez-Rodrguez, JA. 2010. The hybrid flow shop scheduling problem. European Journal of Operational Research, 205 (1): 1-18.
30. Sayin, S, and, Karabati, S. 1999. A bicriteria approach to the two machine flow shop scheduling problem. European Journal of Operational Research, 113 (2): 435-449.
31. Sayin, S, and, Kouvelis, P. 2005. The multiobjective discrete optimization problem: A weighted min-max two-stage optimization approach and a bicriteria algorithm. Management Science, 51 (10): 1572-1580.
32. Shiau, DF, Cheng, SC, and, Huan, YM. 2008. Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Expert Systems with Applications, 34 (2): 1133-1143.
33. Shokrollahpour, E, Zandieh, M, and, Dorri, B. 2011. A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. International Journal of Production Research, 49 (11): 3087-3103.
34. Sivrikaya-Serifoglu, F, and, Ulusoy, G. 1998. A bicriteria two-machine permutation flowshop problem. European Journal of Operational Research, 107 (2): 414-430. (Pubitemid 128407554)
35. Su, LH. 2003. A hybrid two-stage flowshop with limited waiting time constraints. Computers and Industrial Engineering, 44 (3): 409-424.
36. Tasgetiren, MF. 2011. A differential evolution algorithm for the no-idle flowshop scheduling problem with total tardiness criterion. International Journal of Production Research, 49 (16): 5033-5050.
37. Tavakkoli-Moghaddam, R, Rahimi-Vahed, A, and, 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. Information Sciences, 177 (22): 5072-5090. (Pubitemid 47331458)
38. Thiagarajan, S, and, Rajendran, C. 2005. Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Computers and Industrial Engineerin g, 49 (4): 463-503. (Pubitemid 41689975)
39. Torabzadeh, E, and, Zandieh, M. 2010. Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop. Advanced Engineering Software, 4 (10): 1238-1243.
40. Tozkoparan, A. Kirca, O., and Chung, C.S., 2003. A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Computers & Operations Research, 30, 2,. 309-320 (Pubitemid 35404984)
41. Tseng, CT, Liao, CJ, and, Liao, TX. 2008. A note on two-stage hybrid flowshop scheduling with missing operations. Computers & Industrial Engineering, 54 (3): 695-704.
42. Tsubone, H. 2000. A comparison between basic cyclic scheduling and variable cyclic scheduling in a two-stage hybrid flow shop. Decision Sciences, 31 (1): 197-222.
43. Wang, H, Jacob, V, and, Rolland, E. 2003. Design of efficient hybrid neural networks for flexible flow shop scheduling. Expert Systems, 20 (4): 208-231.
44. Wong, TC, Chan, FTS, and, Chan, LY. 2009. A resource-constrained assembly job shop scheduling problem with Lot Streaming technique. Computers and Industrial Engineering, 57 (3): 983-995.
45. Yang, J. 2010. A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines. International Journal of Production Research, 48 (5): 1531-1538.
46. Yeung, WK, Ouz, C, and, Cheng, TCE. 2009. Two-machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs. Naval Research Logistics, 56 (7): 593-599.
47. Zobel, CW, and, Keeling, KB. 2008. Neural network-based simulation meta-models for predicting probability distributions. Computers and Industrial Engineering, 54 (4): 879-888. (Pubitemid 351458384)