The scheduling of flow shops with multiple parallel machines per stage, usually referred to as the Hybrid Flow Shop (HFS), is a complex combinatorial problem encountered in many real world applications. Given its importance and complexity, the HFS problem has been intensively studied. This paper presents a literature review on exact, heuristic and metaheuristic methods that have been proposed f...

The max / / C idle no F − problem is solved by a branch and bound algorithm, or a mixed integer programming solver. This problem is known to be NP-hard. The noidle flow-shop configuration, where machines work continuously without idle intervals is an interesting manufacturing environment in many industries. The idle characteristic is a very strong constraint and it affects seriously the value o...

We address the idle speed control problem in automotive electronics using hybrid methods to derive a digital control law with guaranteed properties. Associating a switching system with the hybrid system that describes the engine operation is crucial to developing a computationally feasible approach. For switching systems with minimum and maximum dwell times and controlled resets, we are able to...

It is well-known that production scheduling can be largely categorized into open and closed-shops (Graves (1981)). Open-shops are job-shops, flow-shops, machine-shops and project-shops and deal exclusively with the assignment, sequencing and timing decisions (Pinedo (1995)). Closed-shops on the other hand also deal with the same three decision-groups as open-shops but they also must decide on t...

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is investigated. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among th...

In this paper the problem of serial batch scheduling in a two-stage hybrid flow shop environment with minimizing Makesapn is studied. In serial batching it is assumed that jobs in a batch are processed serially, and their completion time is defined to be equal to the finishing time of the last job in the batch. The analysis and implementation of the prohibited transference of jobs among the mac...

Production planning and scheduling play significant roles in manufacturing system operations and different techniques have been used to enhance their performance. Lot streaming has been studied for decades and is shown to accelerate production flow. This research deals with lot streaming in hybrid flow shops. Multiple products are processed in a multi-stage hybrid flow shop with non-identical m...