Abstract
In this paper, we consider the flexible flowshop problem with unit-time operations and minimum time delays. We present two simple heuristic algorithms to solve this problem along with their worst-case analyses.
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
