Scheduling with conflicts: online and offline algorithms
- 28 October 2008
- journal article
- research article
- Published by Springer Nature in Journal of Scheduling
- Vol. 12 (2) , 199-224
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- OPTVersusLOADin Dynamic Storage AllocationSIAM Journal on Computing, 2004
- Sum Multicoloring of GraphsJournal of Algorithms, 2000
- Approximation of k-set cover by semi-local optimization1997
- Scheduling multiprocessor tasks — An overviewEuropean Journal of Operational Research, 1996
- Mutual exclusion schedulingTheoretical Computer Science, 1996
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Scheduling with incompatible jobsDiscrete Applied Mathematics, 1994
- Scheduling File TransfersSIAM Journal on Computing, 1985
- A note on the decomposition of graphs into isomorphic matchingsActa Mathematica Hungarica, 1983