Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
Authors:
- Bayi ChengBCBayi Cheng
- Shanlin YangSYShanlin Yang
- Xiaoxuan HuXHXiaoxuan Hu
- Bo ChenBCBo Chen
- 1 July 2012
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 36 (7) , 3161-3167
Abstract
No abstract availableKeywords
Funding Information
- National High-Tech Research and Development Program of China (2009AA043403)
- National Natural Science Foundation of China (71131002, 71071045, 60979010, 71101040)
This publication has 18 references indexed in Scilit:
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizesComputers & Operations Research, 2010
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizesTheoretical Computer Science, 2009
- Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithmsInternational Journal of Production Economics, 2006
- Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach2006
- Minimizing makespan on a single batching machine with release times and non-identical job sizesOperations Research Letters, 2005
- Minimizing makespan for single machine batch processing with non-identical job sizes using simulated annealingInternational Journal of Production Economics, 2004
- Genetic algorithms to minimize the weighted number of late jobs on a single machineEuropean Journal of Operational Research, 2003
- Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedureComputers & Operations Research, 2002
- Minimizing makespan on a single batch processing machine with nonidentical job sizesNaval Research Logistics (NRL), 2001
- Scheduling a single batch processing machine with non-identical job sizesInternational Journal of Production Research, 1994