Scheduling steel plates on a roller furnace
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.
KeywordsMixed Integer Linear Program Mixed Integer Linear Program Model Single Machine Schedule Problem Total Weighted Tardiness Mixed Integer Linear Program Formulation
Unable to display preview. Download preview PDF.
- 2.Eiben, A., Smith, J.: Introduction to Evolutionary Computation. Springer, Berlin, (2003)Google Scholar
- 6.Kelleg¨oz, T., Toklu, B., Wilson, J.: Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem. Applied Mathematics and Computation 199, 590-598 (2008)Google Scholar
- 7.Kon´e, O., Artigues, C., Lopez, P., Mongeau, M.: Event-based MILP models for resourceconstrained project scheduling problems. Computers & Operations Research 38, 3–13 (2011) doi: 10.1016/j.cor.2009.12.011Google Scholar
- 8.Pinedo, M.L.: Scheduling - Theory, Algorithms, and Systems (3rd edition). Springer, New York (2008)Google Scholar
- 9.Wang, X., Tang, L.: A simplified scatter search for a special single machine scheduling problem to minimize total weighted tardiness. CDC 2009, 6250–6255 (2009)Google Scholar