Scheduling jobs with release dates on parallel batch processing machines to minimize the makespan
- 16 October 2012
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 8 (1) , 307-318
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machineTheoretical Computer Science, 2005
- Minimizing makespan with release times on identical parallel batching machinesDiscrete Applied Mathematics, 2005
- The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespanTheoretical Computer Science, 2004
- Approximation Algorithms in Batch ProcessingJournal of Combinatorial Optimization, 2003
- On scheduling an unbounded batch machineOperations Research Letters, 2003
- Scheduling one batch processor subject to job release datesDiscrete Applied Mathematics, 2000
- Minimizing makespan on a single batch processing machine with dynamic job arrivalsInternational Journal of Production Research, 1999
- Scheduling a batching machineJournal of Scheduling, 1998
- Efficient Algorithms for Scheduling Semiconductor Burn-In OperationsOperations Research, 1992
- Efficient scheduling algorithms for a single batch processing machineOperations Research Letters, 1986