Heuristic algorithms for scheduling of a batch processor in automobile gear manufacturing
Authors:
- 15 May 2011
- journal article
- research article
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 49 (10) , 2705-2728
Abstract
In this paper we address a scheduling problem for minimising total weighted tardiness. The motivation for the paper comes from the automobile gear manufacturing process. We consider the bottleneck operation of heat treatment stage of gear manufacturing. Real life scenarios like unequal release times, incompatible job families, non-identical job sizes and allowance for job splitting have been considered. A mathematical model taking into account dynamic starting conditions has been developed. Due to the NP-hard nature of the problem, a few heuristic algorithms have been proposed. The performance of the proposed heuristic algorithms is evaluated: (a) in comparison with optimal solution for small size problem instances, and (b) in comparison with ‘estimated optimal solution’ for large size problem instances. Extensive computational analyses reveal that the proposed heuristic algorithms are capable of consistently obtaining near-optimal solutions (that is, statistically estimated one) in very reasonable computational time.Keywords
This publication has 32 references indexed in Scilit:
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony frameworkJournal of the Operational Research Society, 2008
- Learning effective dispatching rules for batch processor schedulingInternational Journal of Production Research, 2008
- Batch processing with interval graph compatibilities between tasksDiscrete Applied Mathematics, 2008
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready timesInternational Journal of Production Research, 2007
- A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job familiesProduction Planning & Control, 2006
- Minimizing number of tardy jobs on a batch processing machine with incompatible job familiesEuropean Journal of Operational Research, 2005
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job familiesInternational 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
- Minimizing total tardiness on a batch processing machine with incompatible job familiesIIE Transactions, 1998
- Scheduling batch processing machines with incompatible job familiesInternational Journal of Production Research, 1995