《2016 FLOW SHOP SCHEDULING ALGORITHM TO MINIMIZE COMPLETION TIME FOR n-JOBS m-MACHINES PROBLEM》.pdf

V. Modrák, R. S. Pandian Algoritam planiranja operacija flow shop u cilju smanjivanja vremena izvršenja kod problema n-poslova i m-strojeva ISSN 1330-3651 UDC/UDK 658.514:004.421.2 FLOW SHOP SCHEDULING ALGORITHM TO MINIMIZE COMPLETION TIME FOR n-JOBS m-MACHINES PROBLEM Vladimír Modrák, R. Sudhakara Pandian Original scientific paper In multi stage job problems, simple priority dispatching rules such as shortest processing time (SPT) and earliest due date (EDD) can be used to obtain solutions of minimum total processing time, but may not sometimes give sequences as expected that are close to optimal. The Johnsons algorithm is especially popular among analytical approaches that are used for solving n-jobs, 2-machines sequence problem. In this paper the presented algorithm is based on converting an m- machine problem to a 2-machine problem. Based on testing and comparison with other relevant methods, the proposed algorithm is offered as a competitive alternative for practical application when solving n-jobs and m-machines problems. Keywords: CDS heuristics, flow shop, genetic algorithm, make-span, slope index Algoritam planiranja operacija flow shop u cilju smanjivanja vremena izvršenja kod problema n-poslova i m-strojeva Izvorni znanstveni članak U problemima posla s više faza, mogu se koristiti jednostavna prioritetna dispečerska pravila kao što su najkraće vrijeme obrade (PT) i najraniji datum