Resolution of some 2-stage hybrid flowshop scheduling problems

The hybrid flow shop scheduling problem

“…A similar problem was studied later with the total number of tardy jobs criterion in [68]. In [205] some mathematical programming formulations and heuristics are provided for a simple two stage HFS with only one machine at the second stage. [95] have recently proposed heuristics for a similar 2-stage problem with release dates and a product mix ratio constraint.…”

A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines

“…The first category of the FS m1,m2 problem involves a single machine at the first machine center and parallel machines at the second center (m1 = 1, m2 > 1), such as those reported by Narasimhan and Panwalkar [4], Sriskandarajah and Sethi [8], Gupta and Tunc [9], Gupta and Tunc [10], Hoogeveen et al [11], Li [12], and Huang and Li [3]. The second category of this problem involves parallel machines at the first center and a common machine at the second center (m1 > 1, m2 = 1), such as those reported by Arthanary and Ramaswamy [2], Mittal and Nagga [13], Gupta [14], Chen [15], Hoogeveen et al [11], Vignier et al [16], Gupta et al [17], Oguz et al [18], and Zhang et al [19]. The third category of the problem involves parallel machines at both centers (m1 > 1, m2 > 1), such as those reported by Paul [5], Narasimhan and Mangiamell [20], Sriskandarajah and Sethi [8], Rajendran and Chaudhuri [21], Guinet et al [22], Haouari and M'Hallah [23], Suresh [24], Soewandi and Elmaghraby [25], and Oguz et al [26].…”

Multicriteria scheduling problems: a survey

“…i | (C max /T max ) with T max = 0 has been studied by Vignier et al [100]. This problem is N P-hard.…”