The two-stage assembly scheduling problem to minimize total completion time with setup times

Computers and Operations Research

Volumn 36, Issue 10, 2009, Pages 2740-2747

  Allahverdi, Ali ^a   Al Anzi, Fawaz S ^a  

^a KUWAIT UNIVERSITY   (Kuwait)

Author keywords

Assembly flowshop; Dominance relation; Heuristic; Scheduling; Total completion time

Indexed keywords

ASSEMBLY MACHINES; SCHEDULING;

ASSEMBLY-SCHEDULING PROBLEMS; DOMINANCE RELATION; HEURISTIC; NP-HARD; PROCESSING TIME; SET-UP TIME; TOTAL COMPLETION TIME; TWO STAGES;

HEURISTIC METHODS;

EID: 62549097706     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.12.001     Document Type: Article

References (26)

1. Lee C.Y., Cheng T.C.E., and Lin B.M.T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science 39 (1993) 616-625
2. Potts C.N., Sevast'janov S.V., Strusevich V.A., Van Wassenhove L.N., and Zwaneveld C.M. The two-stage assembly scheduling problem: complexity and approximation. Operations Research 43 (1995) 346-355
3. Allahverdi A., and Al-Anzi F.S. A PSO and a tabu search heuristics for assembly scheduling problem of the two-stage distributed database application. Computers & Operations Research 33 (2006) 1056-1080
4. Hariri A.M.A., and Potts C.N. A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research 103 (1997) 547-556
5. Haouari M., and Daouas T. Optimal scheduling of the 3-machine assembly-type flow shop. RAIRO Recherche Operationnelle 33 (1999) 439-445
6. Sun X., Morizawa K., and Nagasawa H. Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling. European Journal of Operational Research 146 (2003) 498-516
7. Allahverdi A., and Al-Anzi F.S. Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times. International Journal of Production Research 44 (2006) 4713-4735
8. Al-Anzi F.S., and Allahverdi A. A self-adaptive differential evolution heuristic for two-stage assembly scheduling problem to minimize maximum lateness with setup times. European Journal of Operational Research 182 (2007) 80-94
9. Tozkapan A., Kirca O., and Chung C.S. A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem. Computers & Operations Research 30 (2003) 309-320
10. Al-Anzi F., and Allahverdi A. A hybrid tabu search heuristic for the two-stage assembly scheduling problem. International Journal of Operations Research 3 (2006) 109-119
11. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup considerations. OMEGA The International Journal of Management Sciences 27 (1999) 219-239
12. Allahverdi A., Ng C.T., Cheng T.C.E., and Kovalyov M.Y. A survey of scheduling problems with setup times or costs. European Journal of Operational Research 187 (2008) 985-1032
13. Allahverdi A., and Soroush H.M. The significance of reducing setup times/setup costs. European Journal of Operational Research 187 (2008) 978-984
14. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics and Operations Research 1 (1976) 117-129
15. Onwubolu G., and Davendra D. Scheduling flow shops using differential evolution algorithm. European Journal of Operational Research 171 (2006) 674-692
16. Omran M, Salman A, Engelbrecht A. Self-adaptive differential evolution. In: Proceedings of the international conference on computational intelligence and security, December, Xi'an, China, 2005. p. 192-9.
17. Augusto V., Xie X., and Perdomo V. Operating theatre scheduling using Lagrangian relaxation. European Journal of Industrial Engineering 2 (2008) 172-189
18. Gourgand M., Tchomte S.K., and Quilliot A. Modelling and solving a multimode and multisite industrial problem: Lagrangian relaxation and heuristic approaches. European Journal of Industrial Engineering 2 (2008) 190-206
19. Li X., Ye N., Xu X., and Sawhey R. Influencing factors of job waiting time variance on a single machine. European Journal of Industrial Engineering 1 (2007) 56-73
20. Valente J.M.S. Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. European Journal of Industrial Engineering 1 (2007) 431-448
21. Yu X., Ram B., and Jiang X. Parameter setting in a bio-inspired model for dynamic flexible job shop scheduling with sequence-dependent setups. European Journal of Industrial Engineering 1 (2007) 182-199
22. Hendizadeh S.H., ElMekkawy T.Y., and Wang G.G. Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times. European Journal of Industrial Engineering 1 (2007) 391-413
23. Pessan C., Bouquard J.L., and Neron E. An unrelated parallel machines model for an industrial production resetting problem. European Journal of Industrial Engineering 2 (2008) 153-171
24. Chandrasekaran C., Rajendran C., Krishnaiah Chetty O.V., and Hanumanna D. Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach. European Journal of Industrial Engineering 1 (2007) 152-181
25. Ben Hmida A., Huguet M.J., Lopez P., and Haouari M. Climbing depth-bounded discrepancy search for solving hybrid flow shop problems. European Journal of Industrial Engineering 1 (2007) 223-240
26. Fahmy S.A., ElMekkawy T.Y., and Balakrishnan S. Deadlock-free scheduling of flexible job shops with limited capacity buffers. European Journal of Industrial Engineering 2 (2008) 231-252