hrcak mascot   Srce   HID

Original scientific paper

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

Fulltext: english, pdf (129 KB) pages 273-278 downloads: 18.362* cite
APA 6th Edition
Modrák, V. & Pandian, R.S. (2010). Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Tehnički vjesnik, 17 (3), 273-278. Retrieved from https://hrcak.srce.hr/59638
MLA 8th Edition
Modrák, Vladimír and R. Sudhakara Pandian. "Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem." Tehnički vjesnik, vol. 17, no. 3, 2010, pp. 273-278. https://hrcak.srce.hr/59638. Accessed 16 Apr. 2021.
Chicago 17th Edition
Modrák, Vladimír and R. Sudhakara Pandian. "Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem." Tehnički vjesnik 17, no. 3 (2010): 273-278. https://hrcak.srce.hr/59638
Harvard
Modrák, V., and Pandian, R.S. (2010). 'Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem', Tehnički vjesnik, 17(3), pp. 273-278. Available at: https://hrcak.srce.hr/59638 (Accessed 16 April 2021)
Vancouver
Modrák V, Pandian RS. Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem. Tehnički vjesnik [Internet]. 2010 [cited 2021 April 16];17(3):273-278. Available from: https://hrcak.srce.hr/59638
IEEE
V. Modrák and R.S. Pandian, "Flow shop scheduling algorithm to minimize completion time for n-jobs m-machines problem", Tehnički vjesnik, vol.17, no. 3, pp. 273-278, 2010. [Online]. Available: https://hrcak.srce.hr/59638. [Accessed: 16 April 2021]

Abstracts
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.

Keywords
make-span; flow shop; slope index; CDS heuristics; genetic algorithm

Hrčak ID: 59638

URI
https://hrcak.srce.hr/59638

[croatian]

Visits: 18.947 *