Multiple Orders Per Job Compatible Batch Scheduling
Authors:
- Vishnu ErramilliVEVishnu Erramilli
- Scott J. MasonSMScott J. Mason
- 1 October 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronics Packaging Manufacturing
- Vol. 29 (4) , 285-296
Abstract
This paper investigates the problem of grouping different customer orders into jobs and these formed jobs to batches and scheduling them on a single batch processing machine to minimize the total weighted tardiness of orders. A compatible batching environment is considered in which there is no restriction on the orders being from the same family to be batched together. A mixed-integer program (MIP) is developed and tested. The compatible MIP model takes 1 + h, on average, to solve an instance. A new simulated annealing-based heuristic solves compatible problems to within 4% of optimality in a few minutes. This fast, near optimal performance suggests that these heuristics may be viable for implementation in practical manufacturing settings, such as burn-in operations in the back end of the semiconductor manufacturing processKeywords
This publication has 15 references indexed in Scilit:
- Modelling and analysis of wafer fabrication scheduling via generalized stochastic Petri net and simulated annealingInternational Journal of Production Research, 2003
- A heuristic to minimize the total weighted tardiness with sequence-dependent setupsIIE Transactions, 1997
- Minimizing total completion time on batch processing machinesInternational Journal of Production Research, 1993
- Efficient Algorithms for Scheduling Semiconductor Burn-In OperationsOperations Research, 1992
- Job Shop Scheduling by Simulated AnnealingOperations Research, 1992
- Single Machine Tardiness Sequencing HeuristicsIIE Transactions, 1991
- Tabu Search—Part IINFORMS Journal on Computing, 1989
- The Shifting Bottleneck Procedure for Job Shop SchedulingManagement Science, 1988
- Priority Rules for Job Shops with Weighted Tardiness CostsManagement Science, 1987
- An Application of Bin-Packing to Multiprocessor SchedulingSIAM Journal on Computing, 1978