This paper describes a new algorithm for solving the flow-shop scheduling problem of n/m/F/F max to minimize maximum flow time. A set of 2000 randomly produced problems of different sizes was solved and compared with three well-known heuristics. The result reveals that the new algorithm improves the best heuristics in performance measures by a significant percentage. Also, because the number of necessary operations for solving problems in this algorithm is independent of the number of machines involved, it is apt for systems with large numbers of machines. This work helps in solving flow-shop scheduling problems for manufacturing systems with large numbers of machines.
![Sample our Economics, Finance,Business & Industry journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5931/TOC-Subject-Sample-2021-Economics-Finance-Business-Industry.jpg"})
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Scheduling in Flowshops with No-Idle Machines
Source:
Springer Berlin Heidelberg
Linking provided by
