Abstract
We study the scheduling problem of minimizing total load on a proportionate flowshop. We consider position-dependent job processing times in the most general way. We show that this problem is solved in O(n4) time, where n is the number of jobs. We then extend the setting to allow job-rejection, where the scheduler may decide to process only a subset of the jobs, and the rejected jobs are penalized. This extension is shown to be solved in O(n5) time.
Original language | English |
---|---|
Pages (from-to) | 39-43 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 132 |
DOIs | |
State | Published - Apr 2018 |
Keywords
- Job-rejection
- Position-dependent processing times
- Proportionate flowshop
- Scheduling
- Total load
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications