Abstract
This paper presents a heuristic algorithm to solve flow shop scheduling problems (FSSP) with the criterion to minimise the system utilisation time with minimum of maximum completion time (makespan)...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
