Scheduling and fixed-parameter tractability
- 4 November 2014
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 154 (1-2) , 533-562
Abstract
No abstract availableKeywords
All Related Versions
This publication has 32 references indexed in Scilit:
- Stable assignment with couples: Parameterized complexity and local searchDiscrete Optimization, 2011
- Minimizing weighted flow timeACM Transactions on Algorithms, 2007
- Techniques for scheduling with rejectionJournal of Algorithms, 2003
- On the parametric complexity of schedules to minimize tardy tasksTheoretical Computer Science, 2003
- Preemptive scheduling with rejectionMathematical Programming, 2003
- W[2]-hardness of precedence constrained K-processor schedulingOperations Research Letters, 1995
- Color-codingJournal of the ACM, 1995
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956