Complexity results for parallel machine problems with a single server
- 7 November 2002
- journal article
- conference paper
- Published by Wiley in Journal of Scheduling
- Vol. 5 (6) , 429-457
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Parallel machine scheduling with a common serverDiscrete Applied Mathematics, 2000
- Scheduling equal-length jobs on identical parallel machinesDiscrete Applied Mathematics, 2000
- Scheduling for parallel dedicated machines with a single serverNaval Research Logistics (NRL), 2000
- Complexity Results for Single-Machine Problems with Positive Finish-Start Time-LagsComputing, 1999
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing timesJournal of Scheduling, 1999
- Parallel machine scheduling problems with a single serverMathematical and Computer Modelling, 1997
- Scheduling Theory. Single-Stage Systems1994
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955