Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 174-177 |
Number of pages | 4 |
Journal | Information Processing Letters |
Volume | 111 |
Issue number | 4 |
DOIs | |
State | Published - 15 Jan 2011 |
Keywords
- Makespan
- Position-dependent processing times
- Proportionate flowshop
- Scheduling
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications