Scheduling unit length jobs with parallel nested machine processing set restrictions
Authors:
- C.A. GlassCGC.A. Glass
- H.R. MillsHMH.R. Mills
- 1 March 2006
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 33 (3) , 620-638
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Effective neighbourhood functions for the flexible job shop problemJournal of Scheduling, 2000
- Complexity of scheduling problems with multi-purpose machinesAnnals of Operations Research, 1997
- Lower bounds for the job-shop scheduling problem on multi-purpose machinesDiscrete Applied Mathematics, 1995
- Analysis of scheduling problems with typed task systemsDiscrete Applied Mathematics, 1994
- UET-scheduling with constrained processor allocationsComputers & Operations Research, 1992
- Linear-Time Algorithms for Scheduling on Parallel ProcessorsOperations Research, 1982
- Technical Note—Minimizing Average Flow Time with Parallel MachinesOperations Research, 1973