Mathirajan, M and Sivakumar, AI (2006) Scheduling a Burn-In Oven with Non-Agreeable Release Times and Due Dates. In: Presented in OR 48 Annual Conference of OR Society of UK, University of Bath, 11-13 Sep 2006, Bath, UK.Full text not available from this repository.
We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modelled as batch processing machines. Most of the studies assume that ready times and due dates of jobs are agreeable (i.e., ri < rj implies di ≤ dj). In many real world applications, the agreeable property assumption does not hold. Therefore, in this paper, scheduling of a single burn-in oven with non-agreeable release times and due dates along with non-identical job sizes as well as non-identical processing of time problem is formulated as a Non-Linear (0-1) Integer Programming optimisation problem. The objective measure of the problem is minimising the maximum completion time (makespan) of all jobs. Due to computational intractability, we have proposed four variants of a two-phase greedy heuristic algorithm. Computational experiments indicate that two out of four proposed algorithms have excellent average performance and also capable of solving any large-scale real life problems with a relatively low computational effort on a Pentium IV computer.
|Item Type:||Conference Paper|
|Department/Centre:||Division of Information Sciences > Management Studies|
|Date Deposited:||22 Nov 2011 06:45|
|Last Modified:||22 Nov 2011 06:45|
Actions (login required)