Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem

Tehnicki Vjesnik

Volumn 17, Issue 3, 2010, Pages 273-278

  Modrák, Vladimír ^a   Pandian, R Sudhakara ^b  

^a TECHNICAL UNIVERSITY OF KO ICE   (Slovakia)

^b KALASALINGAM UNIVERSITY   (India)

Author keywords

CDS heuristics; Flow shop; Genetic algorithm; Make span; Slope index

Indexed keywords

ANALYTICAL APPROACH; CDS; COMPLETION TIME; EARLIEST DUE DATES; FLOW SHOP; FLOW-SHOP SCHEDULING; MAKE-SPAN; MULTI STAGE; PRIORITY DISPATCHING RULES; PROCESSING TIME; SLOPE INDEX; TOTAL PROCESSING TIME;

GENETIC ALGORITHMS; MACHINE SHOP PRACTICE;

SCHEDULING ALGORITHMS;

EID: 79951987966     PISSN: 13303651     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (28)

1. Modrák, V.; Modrák, J. Relationships between Batch Sizes, Sequencing and Lead-times. Proceedings of the 6th International Conference on Informatics in Control, Automation and Robotics, Intelligent Control Systems and Optimization, Milan, Italy, July 2-5, 2009. INSTICC Press 2009, 380-383.
2. Johnson, S. M. Optimal Two and Three Stage Production Schedules with Set-Up Times, Included, Naval Research Logistics Quarterly, 1 (1954), 61-68.
3. Garey, M. R. D.; Johnson, D. S.; Sethi, R. The complexity of flow shop and job shop scheduling. Mathematics of Operations Research, 1 (1976), 117-129.
4. Ruiz, R. Vallada, E.; Fernandez-Martinez, C. In. Computational Intelligence in Flow Shop and Job Shop Scheduling, Volume 230/2009, Springer Berlin/Heidelberg. (2009)
5. Gupta, J. N. D. Analysis of combinatorial approach to flow shop scheduling problems. Journal of the Operational Research Society, 26 (1975), 431-440.
6. Allahverdi, A.; Gupta, J. N. D.; Aldowaisan, T. A review of scheduling research involving set-up considerations. Omega, 27 (1999), 219-239.
7. Conway, R. W.; Maxwell, W. L.; Miller, L. W. Theory of Scheduling, Addison-Wesley:Reading, MA, 1967.
8. Pinedo, M. Scheduling: Theory, Algorithms and Systems. Prentice Hall, New Jersey, second edition, 2002.
9. Palmer, D. S. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum, Operations Research. Q. 16 (1965), 101-107.
10. Campbell, H. G.; Dudek, R. A.; Smith, M. L. A Heuristic Algorithm for the n-Job, m-Machine Sequencing Problem, Management Science, 16, 10 (1970), 630-637.
11. Dannenbring, David G. An Evaluation of Flow Shop Sequencing Heuristics, Management Science, 23, 11 (1977), 1174-1182.
12. Brucker, P.; Jurisch, B.; Sievers, B. A branch and bound algorithm for the job shop scheduling problem. Discrete Applied Mathematics, 49, 1 (1994), 109-127.
13. Gendreau, M.; Laporte, G.; Semet, F. A tabu search heuristic for the undirected selective travelling salesman problem, European Journal of Operational Research, Elsevier, 106, 2-3 (1998), 539-545. (Pubitemid 128399667)
14. Nowicki, E.; Smutnicki, C. A fast taboo search algorithm for the job shop problem. Management Science, 42, 6 (1996), 797-813. (Pubitemid 126577322)
15. Logendran, R.; de Szoeke, P.; Barnard, F. Sequencedependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102 (2006), 66-86. (Pubitemid 43374568)
16. Manikas. A.; Chang, Y. L. Multi-criteria sequence-dependent job shop scheduling using genetic algorithms Computers & Industrial Engineering, 56 (2009), 179-185.
17. Murata, T.; Ishibuchi. H.; Tanaka, H. Genetic Algorithms for Flow shop Scheduling Problems, Computers & Industrial Engineering, 30, 4 (1996), pp. 1061-1071. (Pubitemid 126375914)
18. Balas, E. and A. Vazacopoulos. Guided Local Search with Shifting Bottleneck for Job Shop Scheduling. Management Science, 44, 2 (1998), 262-275. (Pubitemid 128596865)
19. Blum, C.; Sampels, M. An Ant Colony Optimization Algorithm for Shop Scheduling Problems. Journal of Mathematical Modelling and Algorithms, 3, 3 (2004), 285-308. (Pubitemid 40678150)
20. Page, E. S. An Approach to Scheduling of Jobs on the Machines, J. Royal Stat. Soc., V23, (1961), pp. 484-492.
21. Gupta, J. N. D.: Heuristic algorithms for multistage flow shop scheduling problem, AIIE Transactions, 4, (1) (1972), 11-18.
22. Nawaz. M.; Enscore, E.; Ham, I. Aheuristic algorithm for the m machine, n job flow shop sequence problem, OMEGA, 11, 1 (1983), 91-95.
23. Ogbu, F. A.; Smith, D. K. The application of the simulated annealing algorithm to the solution of the n/m/Cmax flow shop problem, Computers & Operations Research, 17, 3 (1990), 243-253. (Pubitemid 20674248)
24. Taillard, E. Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 1 (1990), 65-74. (Pubitemid 20733430)
25. Nagar, A.; Heragu, S. S.; Haddock, J. A combined branchand-bound and genetic algorithm based approach for a flow shop-scheduling problem. Annal. Oper. Res., 63 (1996), 397-414.
26. Neppalli, V. R.; Chen, C. L.; Gupta, J. N. D. Genetic algorithms for the two-stage bicriteria flow shop problem. Eur. J. Oper. Res., 95 (1996), 356-373. (Pubitemid 126391994)
27. Engin, O.; Doyen, A. A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Generation Computer Systems, 20 (2004), 1083-1095.
28. Valíček, J.; Hloch, S.; Kozak, D. Surface geometric parameters proposal for the advanced control of abrasive waterjet technology. The International Journal of Advanced Manufacturing Technology. 41, 3-4 (2009), 323-328.