Most scheduling studies assume constant (position-independent) job processing times. Most of the papers allowing position-dependent processing times consider only special cases, where the job processing times follow a specific function of the job-position. Polynomial time solutions have hardly been found for general position-dependent processing times in scheduling literature. In this note we provide one of these cases: we introduce a polynomial time solution for minimum makespan on an m-machine proportionate flowshop.
Bibliographical noteFunding Information:
Gur Mosheiov is The Charles Rosen Professor of Management, The School of Business Administration, The Hebrew University, Jerusalem. This research was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem.
- Position-dependent processing times
- Proportionate flowshop