Cuckoo Search on Parallel Batch Processing Machines
- 9 February 2018
- book chapter
- Published by Springer Nature
- p. 645-653
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- A hybrid coding SA method for multi-item capacity-constrained production and delivery scheduling problem with arbitrary job volumes and customer inventory considerationsInternational Journal of Industrial and Systems Engineering, 2016
- Effective heuristic for makespan minimization in parallel batch machines with non-identical capacitiesInternational Journal of Production Economics, 2015
- A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machinesOptimization Letters, 2015
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization servicesEuropean Journal of Operational Research, 2014
- A New MIP Model for Parallel-Batch Scheduling with Non-identical Job Sizes2014
- Heuristics to schedule uniform parallel batch processing machines with dynamic job arrivalsInternational Journal of Computer Integrated Manufacturing, 2013
- Variable neighbourhood search for minimising tardiness objectives on flow shop with batch processing machinesInternational Journal of Production Research, 2011
- Heuristics for makespan minimization on parallel batch processing machines with unequal job ready timesThe International Journal of Advanced Manufacturing Technology, 2009
- Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizesInternational Journal of Production Research, 2009
- A GRASP approach for makespan minimization on parallel batch processing machinesJournal of Intelligent Manufacturing, 2009