ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates

Mathirajan, Muthu and Bhargav, V and Ramachandran, V (2010) Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates. In: International Journal of Advanced Manufacturing Technology, 48 (9-12). pp. 1133-1148.

[img] PDF
total.pdf - Published Version
Restricted to Registered users only

Download (373Kb) | Request a copy
Official URL: http://dx.doi.org/10.1007/s00170-009-2342-y

Abstract

This study considers the scheduling problem observed in the burn-in operation of semiconductor final testing, where jobs are associated with release times, due dates, processing times, sizes, and non-agreeable release times and due dates. The burn-in oven is modeled as a batch-processing machine which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity and the processing time of a batch is equal to the longest time among all the jobs in the batch. Due to the importance of on-time delivery in semiconductor manufacturing, the objective measure of this problem is to minimize total weighted tardiness. We have formulated the scheduling problem into an integer linear programming model and empirically show its computational intractability. Due to the computational intractability, we propose a few simple greedy heuristic algorithms and meta-heuristic algorithm, simulated annealing (SA). A series of computational experiments are conducted to evaluate the performance of the proposed heuristic algorithms in comparison with exact solution on various small-size problem instances and in comparison with estimated optimal solution on various real-life large size problem instances. The computational results show that the SA algorithm, with initial solution obtained using our own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.

Item Type: Journal Article
Related URLs:
Additional Information: Copyright of this article belongs to Springer.
Keywords: Scheduling of burn-in oven;Total weighted tardiness;ILP model;Greedy heuristic algorithms; Simulated annealing; Computational experiments; Estimated optimal solution
Department/Centre: Division of Information Sciences > Management Studies
Date Deposited: 23 Jun 2010 10:00
Last Modified: 29 Oct 2013 05:27
URI: http://eprints.iisc.ernet.in/id/eprint/28290

Actions (login required)

View Item View Item