Tehnički vjesnik, Vol. 17 No. 3, 2010.
Izvorni znanstveni članak
Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem
Vladimír Modrák
; Faculty of Manufacturing Technologies, Technical University of Košice, Bayerova 1, Presov, Slovakia
R. Sudhakara Pandian
; Department of Mechanical Engineering, Kalasalingam University, Krishnankoil-626190, Virudhunagar, India
Sažetak
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 Johnson's 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.
Ključne riječi
make-span; flow shop; slope index; CDS heuristics; genetic algorithm
Hrčak ID:
59638
URI
Datum izdavanja:
30.9.2010.
Posjeta: 21.666 *