Sequence-dependent flow shop scheduling problem minimising the number of tardy jobs

International Journal of Production Research

Volumn 50, Issue 20, 2012, Pages 5843-5858

  Varmazyar, Mohsen ^a   Salmasi, Nasser ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

flow shop; imperialist competitive; mathematical modelling; minimising the number of tardy jobs; sequence dependent setup time; tabu search

Indexed keywords

COMPETITIVE ALGORITHMS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; IMPERIALIST COMPETITIVE; META HEURISTIC ALGORITHM; MIXED INTEGER LINEAR PROGRAMMING; NP-HARD; NUMBER OF TARDY JOBS; RANDOM TESTS; RESEARCH PROBLEMS; SEQUENCE-DEPENDENT; SEQUENCE-DEPENDENT SETUP TIME; SPLIT-PLOT DESIGN; STATISTICAL EXPERIMENTS;

EXPERIMENTS; HEURISTIC ALGORITHMS; MACHINE SHOP PRACTICE; MATHEMATICAL MODELS; SCHEDULING; TABU SEARCH;

PROBLEM SOLVING;

EID: 84867356068     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2011.632385     Document Type: Article

References (20)

1. Allahverdi, A. and Soroush, H.M., 2008. The significance of reducing setup times/setup costs. European Journal of Operational Research, 187 (3), 978-984.
2. Allahverdi, A., et al., 2008. A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187 (3), 985-1032.
3. Atashpaz-Gargari, E. and Lucas, C., 2007. Imperialist Competitive Algorithm: An algorithm for optimization inspired by imperialistic competition. IEEE Congress on Evolutionary Computation, 4661-4667.
4. Bulfin, R.L. and M'Hallah, R., 2003. Minimizing the weighted number of tardy jobs on a two-machine flowshop. Computers & Operations Research, 30 (12), 1887-1900.
5. Campbell, H.G., Dudek, R.A., and Smith, M.L., 1970. A heuristic algorithm for the n-job and m-machine sequencing problem. Management Science, 16 (10), 630-637.
6. Chen, C.L. and Chen, C.L., 2008. Bottleneck-based heuristic to minimize tardy jobs in flexible flow line with unrelated parallel machines. International Journal of Production Research, 46 (22), 6415-6430.
7. Della Croce, F., Gupta, J.N.D., and Tadei, R., 2000. Minimizing tardy jobs in a flowshop with common due date. European Journal of Operational Research, 120 (2), 375-381.
8. Glover, F., 1989. Tabu search - Part I. ORSA Journal on Computing, 1, 190-206.
9. Glover, F., 1990. Tabu search - Part II. ORSA Journal on Computing, 2, 4-32.
10. Gupta, J.N.D. and Tunc, E.A., 1998. Minimizing tardy jobs in a two-stage hybrid flowshop. International Journal of Production Research, 36 (9), 2397-2417.
11. Hariri, A.M.A. and Potts, C.N., 1989. A branch and bound algorithm to minimize the number of late jobs in a permutation flowshop. European Journal of Operational Research, 38 (2), 228-237.
12. Johnson, S.M., 1954. Optimal two-and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1 (1), 61-68.
13. Lenstra, J.K., Rinnooy Kan, A.H.G., and Brucker, P., 1977. Complexity of machine scheduling. Annals of Discrete Mathematics, 1, 343-62.
14. Montgomery, D.C., 2009. Design and analysis of experiments. New York: Wiley.
15. Moore, J.M., 1968. An n job, one machine sequencing algorithm for minimizing the number of late. Management Science, 15, 102-109.
16. Naderi, B., Zandieh, M., and Fatemi Ghomi, S.M.T., 2009. Scheduling job shop problems with sequence-dependent setup times. International Journal of Production Research, 47 (21), 5959-5976.
17. Pinedo, M.L., 2008. Scheduling, theory, algorithms, and systems. New York: Prentice Hall.
18. Ruiz-Torresa, A.J., Ablanedo-Rosasb, J.H., and Ho, J.C., 2010. Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility. Computers & Operations Research, 37 (2), 282-291.
19. Salmasi, N., Logendran, R., and Skandari, M.R., 2010. Total flowtime minimization in a flowshop sequence-dependent group scheduling problem. Computers & Operations Research, 37 (1), 199-212.
20. Sung, C.S. and Kim, Y.H., 2003. Minimizing due date related performance measures on two batch processing machines. European Journal of Operational Research, 147 (3), 644-656.