We study the classical scheduling problem of minimizing makespan on a proportionate flowshop. Position-dependent job processing times in the most general way are considered. We introduce a polynomial time solution procedure which is more efficient than the one known in the literature. The problem is further extended to allow job-rejection. This more general version is shown to be solved in polynomial time as well.
Bibliographical notePublisher Copyright:
© 2016, Springer-Verlag Berlin Heidelberg.
- Job rejection
- Position-dependent processing times