Abstract
Abstract We consider the two machine flow shop and open shop problems to minimize the weighted mean flow-time, processing times being equal to 0 or 1. The solution to the open shop problem is based on algorithms for the flow shop problem and the corresponding two parallel identical machine problem. For all problems O (n log n) algorithms are proposed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have