A heuristic for maximizing the number of on‐time jobs on two uniform parallel machines
- 3 May 2006
- journal article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 53 (6) , 568-575
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Optimal non-preemptive semi-online scheduling on two related machinesJournal of Algorithms, 2005
- Optimal preemptive semi-online scheduling to minimize makespan on two related machinesOperations Research Letters, 2002
- A unified approach to approximating resource allocation and schedulingJournal of the ACM, 2001
- Randomized on-line scheduling on two uniform machinesJournal of Scheduling, 2001
- The Accommodating Function: A Generalization of the Competitive RatioSIAM Journal on Computing, 2001
- Approximating the Throughput of Multiple Machines in Real-Time SchedulingSIAM Journal on Computing, 2001
- Analysis of a Hybrid Algorithm for Packing Unequal BinsSIAM Journal on Computing, 1988
- Bounds for List Schedules on Uniform ProcessorsSIAM Journal on Computing, 1980
- Combinatorial Analysis of an Efficient Algorithm for Processor and Storage AllocationSIAM Journal on Computing, 1979
- Bin packing: Maximizing the number of pieces packedActa Informatica, 1978