Flow shop scheduling problem with limited machine availability: A heuristic approach

Abstract

This paper addresses the flow shop scheduling problem with limited machine availability. In such a problem, n jobs has to be scheduled on m machines under the makespan criterion and under the assumption that the machines are not available during the whole planning horizon. Since the makespan minimization is strongly NP-hard, we propose a heuristic approach to approximately solve the problem that consists in scheduling the jobs two by two according to an input sequence, and using a polynomial algorithm. This algorithm is an extension of the geometric approach developed for the two-job shop scheduling problem. r

Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

“…[21,22,31,32,35] for some references on the problem for different settings). Most of the works on flowshops are restricted to the 2-machine case (see [5,7,8,10,11,24,36,37]), and only [2][3][4]28] consider the case for more than 3 machines. Aside, in these works, availability constraints are represented by windows or holes, i.e.…”

Scheduling optimization of a stochastic flexible job-shop system with time-varying machine failure rate

“…A dynamic programming approach is suggested by Allaoui et al [4] to deal with the non-resumable case when there is a single unavailability period on the first machine. In another study presented by Aggoune and Portmann [2], the authors first proposed a special case of two jobs scheduling with PM periods and then a greedy heuristic to solve the problem with more than two jobs. Ruiz et al [48] considered scheduling and preventive maintenance in a permutation flow shop problem and evaluated some adaptations of existing heuristics and meta-heuristics to minimize the makespan.…”

A survey of scheduling with deterministic machine availability constraints

“…Since the problem is NP-hard in the strong sense, a heuristic approach based on a genetic algorithm and a tabu search is proposed to approximately solve the problem. Later, Aggoune and Portmann (2006) present a temporized geometric approach to solve the problem with two jobs.…”