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...

Full description

Saved in:
Bibliographic Details
Published in:Independent Journal of Management & Production 2015-01, Vol.6 (1), p.211-238
Main Authors: Oliveira, Renata Melo e Silva de, Ribeiro, Maria Sofia F. Oliveira de Castro
Format: Article
Language:English
Subjects:
Constraint Programming
Employment
Integer programming
Job
Job shops
Linear algebra
Linear equations
Linear programming
Makespan minimization
Mathematical programming
Mixed an Integer Programming
Operations management
Optimization
Production scheduling
Scheduling
shop Scheduling Problem
Studies
Theory of constraints
Traveling salesman problem
Work in process
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c250t-cf8f72a1de33da6f4e906e436964f9faa7826ce508bccd3687bdbada2cf1d3923
cites
container_end_page 238
container_issue 1
container_start_page 211
container_title Independent Journal of Management & Production
container_volume 6
creator Oliveira, Renata Melo e Silva de
Ribeiro, Maria Sofia F. Oliveira de Castro
description 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.
doi_str_mv 10.14807/ijmp.v6i1.262
format article
fullrecord <record><control><sourceid>proquest_dialn</sourceid><recordid>TN_cdi_dialnet_primary_oai_dialnet_unirioja_es_ART0001047064</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3723083481</sourcerecordid><originalsourceid>FETCH-LOGICAL-c250t-cf8f72a1de33da6f4e906e436964f9faa7826ce508bccd3687bdbada2cf1d3923</originalsourceid><addsrcrecordid>eNpVUU1Lw0AQXUTBUnv1HBC8Je5HuknASyl-VCqKreBt2exHuyHJxt2k2H9vYlX0NI95780M8wA4RzBCcQqTK1NUTbSjBkWY4iMwwpjQENPs7fgPPgUT7wsIISKUYoRHYDu3VcOdqTfBo_lQMrgMFnWrNsoFz85uHK-qgdv5KJjb2reOm7r9R-X7wNtyN8AHm4errW2Cldgq2ZVDr5fmpar8GTjRvPRq8l3H4PX2Zj2_D5dPd4v5bBkKPIVtKHSqE8yRVIRITnWsMkhVTGhGY51pzpMUU6GmMM2FkISmSS5zLjkWGkmSYTIG14e50vCyVi1rnKm42zPLDfvpdbVxxhacKc9mL-vhITBOII17-8XB3jj73infssJ2ru4vZohmMCYEZaRXRQeVcNZ7p_TvFgTZVx5syIMNebA-D_IJ5ZqBZw</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1690433193</pqid></control><display><type>article</type><title>Comparing Mixed &amp; Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><source>ABI/INFORM Global (ProQuest)</source><creator>Oliveira, Renata Melo e Silva de ; Ribeiro, Maria Sofia F. Oliveira de Castro</creator><creatorcontrib>Oliveira, Renata Melo e Silva de ; Ribeiro, Maria Sofia F. Oliveira de Castro</creatorcontrib><description>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.</description><identifier>ISSN: 2236-269X</identifier><identifier>EISSN: 2236-269X</identifier><identifier>DOI: 10.14807/ijmp.v6i1.262</identifier><language>eng</language><publisher>Sao Paulo: Independent Journal of Management &amp; Production, I J M &amp; P</publisher><subject>Constraint Programming ; Employment ; Integer programming ; Job ; Job shops ; Linear algebra ; Linear equations ; Linear programming ; Makespan minimization ; Mathematical programming ; Mixed an Integer Programming ; Operations management ; Optimization ; Production scheduling ; Scheduling ; shop Scheduling Problem ; Studies ; Theory of constraints ; Traveling salesman problem ; Work in process</subject><ispartof>Independent Journal of Management &amp; Production, 2015-01, Vol.6 (1), p.211-238</ispartof><rights>Copyright Independent Journal of Management &amp; Production, I J M &amp; P Jan-Mar 2015</rights><rights>LICENCIA DE USO: Los documentos a texto completo incluidos en Dialnet son de acceso libre y propiedad de sus autores y/o editores. Por tanto, cualquier acto de reproducción, distribución, comunicación pública y/o transformación total o parcial requiere el consentimiento expreso y escrito de aquéllos. Cualquier enlace al texto completo de estos documentos deberá hacerse a través de la URL oficial de éstos en Dialnet. Más información: https://dialnet.unirioja.es/info/derechosOAI | INTELLECTUAL PROPERTY RIGHTS STATEMENT: Full text documents hosted by Dialnet are protected by copyright and/or related rights. This digital object is accessible without charge, but its use is subject to the licensing conditions set by its authors or editors. Unless expressly stated otherwise in the licensing conditions, you are free to linking, browsing, printing and making a copy for your own personal purposes. All other acts of reproduction and communication to the public are subject to the licensing conditions expressed by editors and authors and require consent from them. Any link to this document should be made using its official URL in Dialnet. More info: https://dialnet.unirioja.es/info/derechosOAI</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c250t-cf8f72a1de33da6f4e906e436964f9faa7826ce508bccd3687bdbada2cf1d3923</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1690433193/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1690433193?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,11688,25753,27924,27925,36060,37012,44363,44590,74895,75126</link.rule.ids></links><search><creatorcontrib>Oliveira, Renata Melo e Silva de</creatorcontrib><creatorcontrib>Ribeiro, Maria Sofia F. Oliveira de Castro</creatorcontrib><title>Comparing Mixed &amp; Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems</title><title>Independent Journal of Management &amp; Production</title><description>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.</description><subject>Constraint Programming</subject><subject>Employment</subject><subject>Integer programming</subject><subject>Job</subject><subject>Job shops</subject><subject>Linear algebra</subject><subject>Linear equations</subject><subject>Linear programming</subject><subject>Makespan minimization</subject><subject>Mathematical programming</subject><subject>Mixed an Integer Programming</subject><subject>Operations management</subject><subject>Optimization</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>shop Scheduling Problem</subject><subject>Studies</subject><subject>Theory of constraints</subject><subject>Traveling salesman problem</subject><subject>Work in process</subject><issn>2236-269X</issn><issn>2236-269X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><sourceid>PIMPY</sourceid><recordid>eNpVUU1Lw0AQXUTBUnv1HBC8Je5HuknASyl-VCqKreBt2exHuyHJxt2k2H9vYlX0NI95780M8wA4RzBCcQqTK1NUTbSjBkWY4iMwwpjQENPs7fgPPgUT7wsIISKUYoRHYDu3VcOdqTfBo_lQMrgMFnWrNsoFz85uHK-qgdv5KJjb2reOm7r9R-X7wNtyN8AHm4errW2Cldgq2ZVDr5fmpar8GTjRvPRq8l3H4PX2Zj2_D5dPd4v5bBkKPIVtKHSqE8yRVIRITnWsMkhVTGhGY51pzpMUU6GmMM2FkISmSS5zLjkWGkmSYTIG14e50vCyVi1rnKm42zPLDfvpdbVxxhacKc9mL-vhITBOII17-8XB3jj73infssJ2ru4vZohmMCYEZaRXRQeVcNZ7p_TvFgTZVx5syIMNebA-D_IJ5ZqBZw</recordid><startdate>20150101</startdate><enddate>20150101</enddate><creator>Oliveira, Renata Melo e Silva de</creator><creator>Ribeiro, Maria Sofia F. Oliveira de Castro</creator><general>Independent Journal of Management &amp; Production, I J M &amp; P</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>CCPQU</scope><scope>CLZPN</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>M0C</scope><scope>PIMPY</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>AGMXS</scope><scope>FKZ</scope></search><sort><creationdate>20150101</creationdate><title>Comparing Mixed &amp; Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems</title><author>Oliveira, Renata Melo e Silva de ; Ribeiro, Maria Sofia F. Oliveira de Castro</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c250t-cf8f72a1de33da6f4e906e436964f9faa7826ce508bccd3687bdbada2cf1d3923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Constraint Programming</topic><topic>Employment</topic><topic>Integer programming</topic><topic>Job</topic><topic>Job shops</topic><topic>Linear algebra</topic><topic>Linear equations</topic><topic>Linear programming</topic><topic>Makespan minimization</topic><topic>Mathematical programming</topic><topic>Mixed an Integer Programming</topic><topic>Operations management</topic><topic>Optimization</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>shop Scheduling Problem</topic><topic>Studies</topic><topic>Theory of constraints</topic><topic>Traveling salesman problem</topic><topic>Work in process</topic><toplevel>online_resources</toplevel><creatorcontrib>Oliveira, Renata Melo e Silva de</creatorcontrib><creatorcontrib>Ribeiro, Maria Sofia F. Oliveira de Castro</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>ProQuest One Community College</collection><collection>Latin America &amp; Iberia Database</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global (ProQuest)</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>Dialnet (Open Access Full Text)</collection><collection>Dialnet</collection><jtitle>Independent Journal of Management &amp; Production</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Oliveira, Renata Melo e Silva de</au><au>Ribeiro, Maria Sofia F. Oliveira de Castro</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Comparing Mixed &amp; Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems</atitle><jtitle>Independent Journal of Management &amp; Production</jtitle><date>2015-01-01</date><risdate>2015</risdate><volume>6</volume><issue>1</issue><spage>211</spage><epage>238</epage><pages>211-238</pages><issn>2236-269X</issn><eissn>2236-269X</eissn><abstract>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.</abstract><cop>Sao Paulo</cop><pub>Independent Journal of Management &amp; Production, I J M &amp; P</pub><doi>10.14807/ijmp.v6i1.262</doi><tpages>28</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2236-269X
ispartof Independent Journal of Management & Production, 2015-01, Vol.6 (1), p.211-238
issn 2236-269X
2236-269X
language eng
recordid cdi_dialnet_primary_oai_dialnet_unirioja_es_ART0001047064
source Publicly Available Content Database (Proquest) (PQ_SDU_P3); ABI/INFORM Global (ProQuest)
subjects Constraint Programming
Employment
Integer programming
Job
Job shops
Linear algebra
Linear equations
Linear programming
Makespan minimization
Mathematical programming
Mixed an Integer Programming
Operations management
Optimization
Production scheduling
Scheduling
shop Scheduling Problem
Studies
Theory of constraints
Traveling salesman problem
Work in process
title Comparing Mixed & Integer Programming vs. Constraint Programming by solving Job-Shop Scheduling Problems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T19%3A16%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_dialn&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Comparing%20Mixed%20&%20Integer%20Programming%20vs.%20Constraint%20Programming%20by%20solving%20Job-Shop%20Scheduling%20Problems&rft.jtitle=Independent%20Journal%20of%20Management%20&%20Production&rft.au=Oliveira,%20Renata%20Melo%20e%20Silva%20de&rft.date=2015-01-01&rft.volume=6&rft.issue=1&rft.spage=211&rft.epage=238&rft.pages=211-238&rft.issn=2236-269X&rft.eissn=2236-269X&rft_id=info:doi/10.14807/ijmp.v6i1.262&rft_dat=%3Cproquest_dialn%3E3723083481%3C/proquest_dialn%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c250t-cf8f72a1de33da6f4e906e436964f9faa7826ce508bccd3687bdbada2cf1d3923%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1690433193&rft_id=info:pmid/&rfr_iscdi=true