Scheduling independent tasks with multiple modes
Authors:
- L. BiancoLBL. Bianco
- P. Dell'OLmoPDP. Dell'OLmo
- M.GRazia SperanzaMSM.GRazia Speranza
- 1 September 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 62 (1-3) , 35-50
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A decomposition approach for a resource constrained scheduling problemEuropean Journal of Operational Research, 1994
- Hierarchical models for multi-project planning and schedulingEuropean Journal of Operational Research, 1993
- Scheduling multiprocessor tasks on three dedicated processorsInformation Processing Letters, 1992
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary GraphsSIAM Journal on Computing, 1991
- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengthsEuropean Journal of Operational Research, 1991
- A Multi-Stage Decomposition Approach for a Resource Constrained Project Scheduling Problem1991
- On graphs with polynomially solvable maximum‐weight clique problemNetworks, 1989
- The complexity of scheduling independent two-processor tasks on dedicated processorsInformation Processing Letters, 1987
- A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling ProblemA I I E Transactions, 1970
- On chromatic number of finite set-systemsActa Mathematica Hungarica, 1968