Loading…
Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems
Scheduling is a key factor for operations management as well as for business success. So, this work aims to discuss three different optimization models for minimizing makespan. Those three models were applied on 17 classical Job-shop Scheduling problems, which produced different outputs. The first m...
Saved in:
Published in: | Independent Journal of Management & Production 2015-01, Vol.6 (1), p.211-238 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Scheduling is a key factor for operations management as well as for business success. So, this work aims to discuss three different optimization models for minimizing makespan. Those three models were applied on 17 classical Job-shop Scheduling problems, which produced different outputs. The first model resorts on Mixed and Integer Programming (MIP) and it resulted on optimizing 60% of the studied problems. The other models were based on Constraint Programming (CP). In this work, each model is individually analyzed and compared through considering: 1. the optimization success performance, 2. the computational processing time, 3. the greatest resource utilization, and 4. the minimum work-in-process inventory. Results demonstrated that CP-2, which approaches the problem with disjunctive constraints and optimized 88% of the instances, presented best results on criteria 1 and 2; but MIP was superior on criteria 3 and 4. Those findings are discussed at the final section of this work. |
---|---|
ISSN: | 2236-269X 2236-269X |
DOI: | 10.14807/ijmp.v6i1.262 |