Scheduling steel plates on a roller furnace

Eric Ebermann () and Stefan Nickel ()
Additional contact information
Eric Ebermann: Karlsruhe Institute of Technology (KIT)
Stefan Nickel: Karlsruhe Institute of Technology (KIT)

A chapter in Operations Research Proceedings 2011, 2012, pp 389-394 from Springer

Abstract: Abstract We introduce a single machine scheduling problem arising in the heat treatment of steel plates. To the best of our knowledge, there is no study on this problem in the literature up to now. We refer to this problem as the Heat Treatment Furnace Scheduling Problem with Distance Constraints (HTFSPD) and propose a mixed integer linear program (MILP) formulation. Since the problem itself is NPhard and computational times for real world instances are too high, a genetic algorithm is developed in order to provide heuristic solutions. Computational results for some real data sets1 demonstrate the performance of the algorithm compared to the current solution method used in practice.

Keywords: Mixed Integer Linear Program; Mixed Integer Linear Program Model; Single Machine Schedule Problem; Total Weighted Tardiness; Mixed Integer Linear Program Formulation (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_62

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_62

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().