On scheduling unbounded batch processing machine(s)
- 31 May 2010
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 58 (4) , 814-817
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Scheduling jobs with agreeable processing times and due dates on a single batch processing machineTheoretical Computer Science, 2007
- Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machineTheoretical Computer Science, 2005
- Minimizing Mean Completion Time in a Batch Processing SystemAlgorithmica, 2003
- On scheduling an unbounded batch machineOperations Research Letters, 2003
- Scheduling jobs with release dates and deadlines on a batch processing machineIIE Transactions, 2001
- Scheduling a batching machineJournal of Scheduling, 1998