Mathematical programming formulations for hybrid flow shop scheduling with parallel machines at the first stage and two dedicated machines at the second stage

Nabli, Zouhour; Korbaa, Ouajdi; Khalfallah, Sofiane

doi:10.1109/smc.2016.7844921

Cited by 5 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors developed a mixed-integer programming model, which is using valid inequalities based on a set of lower bounds. Nabli et al [14] proposed two mixed-integer programming models (M1 and M2) for solving the hybrid flow shop scheduling problem with parallel machines in the first stage and two dedicated machines in the second stage. The first model (M1) is based on time indexed variables, while the second model (M2) is based on ordering variables.…”

Section: Literature Reviewmentioning

confidence: 99%

Comparing Mixed-Integer Programming and Constraint Programming Models for the Hybrid Flow Shop Scheduling Problem with Dedicated Machines

Bedhief¹

2021

JESA

View full text Add to dashboard Cite

The paper considers a two-stage hybrid flow shop scheduling problem with dedicated machines and release dates. Each job must be first processed on the single machine of stage 1, and then, the job is processed on one of the two dedicated machines of stage 2, depending on its type. Moreover, the jobs are available for processing at their respective release dates. Our goal is to obtain a schedule that minimizes the makespan. This problem is strongly NP-hard. In this paper, two mathematical models are developed for the problem: a mixed-integer programming model and a constraint programming model. The performance of these two models is compared on different problem configurations. And the results show that the constraint programming outperforms the mixed-integer programming in finding optimal solutions for large problem sizes (450 jobs) with very reasonable computing times.

show abstract

Section: Literature Reviewmentioning

confidence: 99%