A GRASP heuristic for slab scheduling at continuous casters

Wichmann, Matthias; Volling, Thomas; Spengler, Thomas
July 2014
OR Spectrum;Jul2014, Vol. 36 Issue 3, p693
Academic Journal
In this paper, we develop an approach for scheduling slabs at continuous casters in the steel industry. The scheduling approach incorporates specific constraints such as flexible production orders, material supply in batches and different setup types. We further introduce a continually adjustable casting width, which corresponds to a technological control parameter. We present a new MILP model formulation, which integrates slab design and scheduling. Solutions for the model are obtained by a greedy randomized adaptive search procedure. We analyze the applicability and performance of the approach in a numerical case study which is based on real world data. High-valued feasible production plans can be obtained in reasonable computing time. The approach is able to solve industry size problem instances in reasonable time. As compared to the status-quo, on average savings in the number of charges of 10.6 % are obtained.


Related Articles

  • Anytime heuristic search for scheduling flexible manufacturing systems: a timed colored Petri net approach. Baruwa, Olatunde; Piera, Miquel // International Journal of Advanced Manufacturing Technology;Oct2014, Vol. 75 Issue 1-4, p123 

    Given the fluctuations in demand, diversity in products, production flexibility requirements, and tight customer due dates, obtaining optimal production schedules is considered a complex research problem. This can drastically affect the survival of some manufacturing companies in today's...

  • On single-machine scheduling with flexible maintenance activities. Xu, Dehua; Yin, Yunqiang // International Journal of Advanced Manufacturing Technology;Oct2011, Vol. 56 Issue 9-12, p1139 

    This paper addresses a single-machine scheduling problem with nonresumable jobs and flexible maintenance activities (SJM) and its online version SJMO. It is showed that the competitive ratio of the classical list scheduling (LS) algorithm is 2 for SJMO, and it is the best possible polynomial...

  • Computational Study of N-Job M-Machine Flow Shop Scheduling Problems: SPT, EDD, NEH, NEH-EDD, and Modified-NEH Algorithms. Kurniawati, Dwi Agustina; Nugroho, Yoga Isnaini // Journal of Advanced Manufacturing Systems;Dec2017, Vol. 16 Issue 4, p375 

    This paper discusses about the flow shop scheduling problems using shortest processing time, earliest due date (EDD), Nawaz, Enscore, and Ham (NEH), NEH-EDD, and modified-NEH methods. The objective of this research is to determine the performance of these methods in minimizing makespan and total...

  • An Integer Linear Programming Model and Heuristics Scheduling EDD for Hardboards Cutting Problem in a Modular Production System. Moengin, Parwadi; Fransiska, Weny Ango // International Journal of Engineering & Technology;Feb2011, Vol. 11 Issue 1, p1 

    In this paper, a two-phase algorithm was developed for the cutting sequencing problems in a modular manufacturing system. This system has a level of flexibility that depends on the cutting phase of raw material. This paper focuses primarily on the work station. In the first phase of the...

  • Simultaneous scheduling of machines and vehicles in an FMS environment with alternative routing. Kumar, M.; Janardhana, Ranga; Rao, C. // International Journal of Advanced Manufacturing Technology;Mar2011, Vol. 53 Issue 1-4, p339 

    Scheduling of flexible manufacturing systems is a well-known NP-hard problem which is very complex, due to additional considerations like material handling, alternative routing, and alternative machines. Improvement in the performance of a flexible manufacturing system can be expected by...

  • Scheduling optimization of flexible manufacturing system using cuckoo search-based approach. Burnwal, Shashikant; Deb, Sankha // International Journal of Advanced Manufacturing Technology;Feb2013, Vol. 64 Issue 5-8, p951 

    In the present work, a cuckoo search (CS)-based approach has been developed for scheduling optimization of a flexible manufacturing system by minimizing the penalty cost due to delay in manufacturing and maximizing the machine utilization time. To demonstrate the application of cuckoo search...

  • A Simulated Annealing-based Heuristic Algorithm for Job Shop Scheduling to Minimize Lateness. Rui Zhang // International Journal of Advanced Robotic Systems;Apr2013, Vol. 10 Issue 4, p1 

    A decomposition-based optimization algorithm is proposed for solving large job shop scheduling problems with the objective of minimizing the maximum lateness. First, we use the constraint propagation theory to derive the orientation of a portion of disjunctive arcs. Then we use a simulated...

  • Flexible Job Shop Models for solving scheduling and layout problems Using Coloured petri nets. ELOUNDOU, José; BAUDRY, David; SAHNOUN, M'hammed; BENSRHAIR, Abdelaziz; LOUIS, Anne; MAZARI, Bélahcène // Applied Mechanics & Materials;2014, Issue 598, p638 

    In this paper we propose models for solving both the layout manufacturing problems and the scheduling manufacturing systems. These models are based on Coloured petri Nets. The particularity of our models is the possibility to include complex programmable functions inside the petri nets models....

  • A Flexible Job-shop Scheduling under Deteriorating Processing Time Environment. Lin Ren; Guohua Zhou; Fangli Xia; Wang Fei; Chenshun Wu // Metallurgical & Mining Industry;2015, Issue 6, p184 

    In order to solve the flexible job shop scheduling problem with deterioration processing time, a model is developed based on the makespan. Improved genetic algorithm is present to explore the relationship and rule between deteriorating processing time and scheduling effect. Finely, a case proves...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics