Author
Listed:
- M. Ramasubramaniam
- M. Mathirajan
- V. Ramachandran
Abstract
This paper addresses a scheduling problem for a single Heat-Treatment Furnace (HTF) in the steel casting industry where the furnace is a Batch Processor (BP). In this problem, each job (casting) has dimension and size (capacity requirement). The BP can process a number of jobs simultaneously as long as the total dimension and total size of these jobs being processed do not exceed the machine capacity in terms of dimension and size. The scheduling objective of the problem is to minimise the maximum completion time (makespan) of all jobs. This paper considers a static case where all jobs are available to process at time zero. We first propose an integer linear programming formulation for the problem and then show its computational intractability empirically. Owing to computational difficulty, we propose a number of Greedy Heuristic Algorithms (GHA) and design a Genetic Algorithm (GA) to solve any large-scale real-life problems. To evaluate the performance of the proposed heuristic algorithms, a lower bound procedure is developed and its efficiency is shown empirically on various small-sized problems in comparison with the optimal solution. Detailed computational experiments are then conducted to evaluate the proposed heuristic algorithms. From the results of the computational experiments, it is observed that the proposed GA can provide a more efficient solution than the other proposed GHA within a very reasonable CPU time on a Pentium IV computer with 1 GB RAM.
Suggested Citation
M. Ramasubramaniam & M. Mathirajan & V. Ramachandran, 2010.
"Minimising makespan on a single heat-treatment furnace in the steel casting industry,"
International Journal of Services and Operations Management, Inderscience Enterprises Ltd, vol. 7(1), pages 112-142.
Handle:
RePEc:ids:ijsoma:v:7:y:2010:i:1:p:112-142
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijsoma:v:7:y:2010:i:1:p:112-142. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=150 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.