An effective discrete differential evolution algorithm for scheduling uniform parallel batch processing machines with non-identical capacities and arbitrary job sizes
Authors:
- Shengchao ZhouSZShengchao Zhou
- Ming LiuMLMing Liu
- Huaping ChenHCHuaping Chen
- Xueping LiXLXueping Li
- 1 September 2016
- journal article
- Published by Elsevier in International Journal of Production Economics
- Vol. 179, 1-11
Abstract
No abstract availableThis publication has 57 references indexed in Scilit:
- A hybrid differential evolution algorithm for a two-stage flow shop on batch processing machines with arbitrary release times and blockingInternational Journal of Production Research, 2014
- An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizesApplied Soft Computing, 2013
- Scheduling a batch processing machine with non-identical job sizes: a clustering perspectiveInternational Journal of Production Research, 2011
- Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivalsInternational Journal of Computer Integrated Manufacturing, 2010
- A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterionThe International Journal of Advanced Manufacturing Technology, 2006
- A hybrid genetic algorithm to minimize makespan for the single batch machine dynamic scheduling problemThe International Journal of Advanced Manufacturing Technology, 2005
- Minimizing makespan on parallel batch processing machinesInternational Journal of Production Research, 2004
- Scheduling a batching machineJournal of Scheduling, 1998
- Single machine batch scheduling with deadlines and resource dependent processing timesOperations Research Letters, 1995
- Minimizing total completion time on batch processing machinesInternational Journal of Production Research, 1993