Abstract
We model and solve the problems of preemptive scheduling of n independent jobs with release dates on m parallel machines with machine availability and eligibility constraints to minimize the makespan and maximum lateness as the minimum-cost network flow problem. We show that the approach can be extended to solve the corresponding scheduling problems on two uniform parallel machines.
Original language | English |
---|---|
Pages (from-to) | 453-458 |
Number of pages | 6 |
Journal | Computers and Industrial Engineering |
Volume | 64 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 2013 |
Keywords
- Minimum-cost network flow
- Parallel machines
- Preemptive jobs
- Scheduling
- Uniform machines
ASJC Scopus subject areas
- General Computer Science
- General Engineering