Time slot scheduling of compatible jobs
Open Access
- 1 February 2007
- journal article
- Published by Springer Nature in Journal of Scheduling
- Vol. 10 (2) , 111-127
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Colouring weighted bipartite graphs with a co-site constraintDiscrete Mathematics, 2000
- Scheduling with batching: A reviewEuropean Journal of Operational Research, 2000
- On Chromatic Sums and Distributed Resource AllocationInformation and Computation, 1998
- Generalized coloring for tree-like graphsDiscrete Applied Mathematics, 1997
- Graph colorings with local constraints -- a surveyDiscussiones Mathematicae Graph Theory, 1997
- Open shop scheduling with some additional constraintsGraphs and Combinatorics, 1996
- Scheduling with incompatible jobsDiscrete Applied Mathematics, 1994
- Chromatic scheduling and frequency assignmentDiscrete Applied Mathematics, 1994
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- On the complexity of decomposing matrices arising in satellite communicationOperations Research Letters, 1985