scholarly journals On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: Constraint programming vs. mixed integer programming

2015 ◽  
Vol 39 (2) ◽  
pp. 955-964 ◽  
Author(s):  
Rashed Sahraeian ◽  
Mohammad Namakshenas
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Constraint Programming ◽  
Total Weighted Tardiness ◽  
Mixed Integer ◽  
Job Shops ◽  
Weighted Tardiness ◽  
Optimal Modeling

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

2021 ◽  
Vol 54 (4) ◽  
pp. 591-597
Author(s):  
Asma Ouled Bedhief
Keyword(s):  
Integer Programming ◽  
Mixed Integer Programming ◽  
Constraint Programming ◽  
Flow Shop ◽  
Programming Model ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Hybrid Flow Shop ◽  
Dedicated Machines ◽  
Hybrid Flow Shop Scheduling

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.

Sign in / Sign up

Export Citation Format

Share Document