An effective iterated greedy algorithm for scheduling unrelated parallel batch machines with non-identical capacities and unequal ready times
Authors:
- José Elias C. ArroyoJAJosé Elias C. Arroyo
- Joseph Y.-T. LeungJLJoseph Y.-T. Leung
- 1 March 2017
- journal article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 105, 84-100
Abstract
No abstract availableKeywords
This publication has 53 references indexed in Scilit:
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready timesComputers & Operations Research, 2017
- A hybrid algorithmic model for the minimum weight dominating set problemSimulation Modelling Practice and Theory, 2016
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shopsComputers & Operations Research, 2016
- Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristicsComputers & Industrial Engineering, 2014
- Bi-objective optimisation for scheduling the identical parallel batch-processing machines with arbitrary job sizes, unequal job release times and capacity limitsInternational Journal of Production Research, 2014
- An improved ant colony optimization for scheduling identical parallel batching machines with arbitrary job sizesApplied Soft Computing, 2013
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizesApplied Mathematical Modelling, 2012
- Minimizing makespan on parallel batch processing machinesInternational Journal of Production Research, 2004
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardinessInternational Journal of Production Research, 2004
- Scheduling a batching machineJournal of Scheduling, 1998