Online scheduling on unbounded parallel-batch machines with incompatible job families
Open Access
- 1 February 2011
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 412 (22) , 2380-2386
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machinesJournal of Scheduling, 2009
- On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobsJournal of Scheduling, 2008
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machinesOperations Research Letters, 2008
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespanJournal of Combinatorial Optimization, 2008
- The single-machine parallel-batching on-line scheduling problem with family jobs to minimize makespanInternational Journal of Production Economics, 2008
- A Flexible On-line Scheduling Algorithm for Batch Machine with Infinite CapacityAnnals of Operations Research, 2005
- Approximation Algorithms in Batch ProcessingJournal of Combinatorial Optimization, 2003
- The Batch Loading and Scheduling ProblemOperations Research, 2001
- Scheduling a batching machineJournal of Scheduling, 1998
- Minimizing total tardiness on a batch processing machine with incompatible job familiesIIE Transactions, 1998