IBM ILOG CP optimizer for scheduling 20+ years of scheduling with constraints at IBM/ILOG

IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization framework. CP Optimizer implements a model-and-run p...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Constraints : an international journal Ročník 23; číslo 2; s. 210 - 250
Hlavní autoři:	Laborie, Philippe, Rogerie, Jérôme, Shaw, Paul, Vilím, Petr
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.04.2018
Témata:	Artificial Intelligence Computer Science Operations Research/Decision Theory Optimization Topical Collection on 20th Anniversary Issue Scheduling Modeling Constraint programming Automatic search
ISSN:	1383-7133, 1572-9354
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization framework. CP Optimizer implements a model-and-run paradigm that vastly reduces the burden on the user to understand CP or scheduling algorithms: modeling is by far the most important. The automatic search provides good performance out of the box and it is continuously improving. This article gives a detailed overview of CP Optimizer for scheduling: typical applications, modeling concepts, examples, automatic search, tools and performance.
AbstractList	IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts to capture the temporal dimension of scheduling problems in a combinatorial optimization framework. CP Optimizer implements a model-and-run paradigm that vastly reduces the burden on the user to understand CP or scheduling algorithms: modeling is by far the most important. The automatic search provides good performance out of the box and it is continuously improving. This article gives a detailed overview of CP Optimizer for scheduling: typical applications, modeling concepts, examples, automatic search, tools and performance.
Author	Laborie, Philippe Rogerie, Jérôme Shaw, Paul Vilím, Petr
Author_xml	– sequence: 1 givenname: Philippe orcidid: 0000-0002-4045-8601 surname: Laborie fullname: Laborie, Philippe email: laborie@fr.ibm.com organization: IBM France – sequence: 2 givenname: Jérôme surname: Rogerie fullname: Rogerie, Jérôme organization: IBM France – sequence: 3 givenname: Paul surname: Shaw fullname: Shaw, Paul organization: IBM France – sequence: 4 givenname: Petr surname: Vilím fullname: Vilím, Petr organization: IBM Czechia
BookMark	eNp9jz1PwzAQhi1UJNrCD2DLwGrw2YntjFDxEakIBpgt27WLqzSp7FQq_HpchYmh051O97x6nxmadH3nELoGcguEiLsEhBPABCSuqQR8OENTqATFNavKSd6ZZFgAYxdoltKGEFILVk7RTfPwWjTLt-di8V70uyFsw4-Lhe9jkeyXW-3b0K0v0bnXbXJXf3OOPp8ePxYvOHPN4n6JLZVywFxzbrSxVpLcBowToqSwykeojHa18UR6WXLKvTFcW1HyighZUgvcV0KzORJjro19StF5ZcOgh9B3Q9ShVUDUUVaNsirLqqOsOmQS_pG7GLY6fp9k6Mik_NutXVSbfh-7LHgC-gXGu2eE
CitedBy_id	crossref_primary_10_1109_TSM_2023_3304517 crossref_primary_10_1007_s10601_024_09376_5 crossref_primary_10_1016_j_conengprac_2022_105430 crossref_primary_10_1016_j_jmsy_2022_09_022 crossref_primary_10_1080_00207543_2023_2266765 crossref_primary_10_1016_j_cor_2022_105728 crossref_primary_10_1016_j_ejor_2025_04_012 crossref_primary_10_1007_s10601_022_09337_w crossref_primary_10_1016_j_omega_2022_102770 crossref_primary_10_1287_ijoc_2024_0603 crossref_primary_10_1016_j_datak_2025_102415 crossref_primary_10_1080_00207543_2025_2551245 crossref_primary_10_1109_TASE_2025_3575531 crossref_primary_10_1080_23302674_2023_2224509 crossref_primary_10_1108_ECAM_07_2024_0970 crossref_primary_10_1016_j_cor_2021_105282 crossref_primary_10_1016_j_cie_2023_108983 crossref_primary_10_1109_JSYST_2024_3359776 crossref_primary_10_1016_j_cie_2022_108128 crossref_primary_10_1007_s00778_019_00539_y crossref_primary_10_1080_0305215X_2020_1786081 crossref_primary_10_1109_LRA_2020_3015464 crossref_primary_10_1016_j_future_2023_07_010 crossref_primary_10_1016_j_cie_2025_111351 crossref_primary_10_1016_j_ejor_2022_03_047 crossref_primary_10_1016_j_cor_2022_105730 crossref_primary_10_1007_s10732_024_09540_3 crossref_primary_10_1016_j_ejor_2020_12_021 crossref_primary_10_1155_2018_6861429 crossref_primary_10_1016_j_apm_2023_06_009 crossref_primary_10_1016_j_procs_2022_12_301 crossref_primary_10_1109_LRA_2021_3056069 crossref_primary_10_1007_s43069_020_00036_x crossref_primary_10_1287_ijoc_2023_0107 crossref_primary_10_1049_tje2_12368 crossref_primary_10_1007_s10696_024_09583_5 crossref_primary_10_1109_ACCESS_2020_2997739 crossref_primary_10_1016_j_ejor_2024_08_010 crossref_primary_10_1080_00207543_2023_2173503 crossref_primary_10_1287_ijoc_2022_1222 crossref_primary_10_1016_j_jmsy_2022_04_018 crossref_primary_10_1016_j_cor_2020_105020 crossref_primary_10_1080_00207543_2019_1571250 crossref_primary_10_1016_j_swevo_2023_101416 crossref_primary_10_1016_j_cie_2025_111065 crossref_primary_10_1177_10692509251353343 crossref_primary_10_1287_ijoc_2023_1280 crossref_primary_10_1016_j_rcim_2023_102620 crossref_primary_10_1080_00207543_2025_2503465 crossref_primary_10_1109_ACCESS_2023_3317533 crossref_primary_10_1109_TASE_2020_3012879 crossref_primary_10_3390_electronics11030357 crossref_primary_10_1287_ijoc_2023_1287 crossref_primary_10_1109_TCYB_2021_3108546 crossref_primary_10_1007_s10845_020_01537_6 crossref_primary_10_1016_j_cie_2022_108586 crossref_primary_10_1016_j_procs_2022_01_365 crossref_primary_10_1016_j_procs_2022_01_366 crossref_primary_10_3390_electronics12244917 crossref_primary_10_3390_fi17080364 crossref_primary_10_1016_j_cie_2023_109454 crossref_primary_10_1007_s10601_020_09317_y crossref_primary_10_1016_j_csbj_2023_10_019 crossref_primary_10_1016_j_omega_2022_102823 crossref_primary_10_1080_01605682_2024_2382867 crossref_primary_10_1016_j_cor_2022_105916 crossref_primary_10_3390_jmse11081517 crossref_primary_10_1016_j_cie_2024_109916 crossref_primary_10_1016_j_eswa_2022_119200 crossref_primary_10_1080_00207543_2021_1885068 crossref_primary_10_1111_poms_13501 crossref_primary_10_3390_jmse12010124 crossref_primary_10_1007_s10951_024_00808_x crossref_primary_10_1016_j_cirp_2024_04_101 crossref_primary_10_1049_cim2_12005 crossref_primary_10_1007_s10479_023_05629_3 crossref_primary_10_1016_j_ejor_2022_01_034 crossref_primary_10_1080_00207543_2023_2253311 crossref_primary_10_1007_s10729_021_09579_9 crossref_primary_10_1287_ijoo_2021_0056 crossref_primary_10_1016_j_ejor_2020_04_050 crossref_primary_10_1016_j_apm_2022_01_001 crossref_primary_10_1007_s10845_019_01518_4 crossref_primary_10_1016_j_apm_2019_05_007 crossref_primary_10_1016_j_compchemeng_2021_107565 crossref_primary_10_1287_ijoc_2023_0128 crossref_primary_10_1016_j_autcon_2025_106272 crossref_primary_10_1080_00207543_2021_1876270 crossref_primary_10_1016_j_orp_2025_100352 crossref_primary_10_1016_j_ejor_2022_02_043 crossref_primary_10_1016_j_cose_2023_103423 crossref_primary_10_1007_s10951_019_00632_8 crossref_primary_10_1007_s11047_025_10016_x crossref_primary_10_1007_s00500_023_09086_9 crossref_primary_10_1007_s00291_020_00595_9 crossref_primary_10_1016_j_cie_2025_111046 crossref_primary_10_1080_00207543_2019_1709671 crossref_primary_10_1080_00207543_2021_1963496 crossref_primary_10_1016_j_cor_2025_107145 crossref_primary_10_1080_0305215X_2021_1957101 crossref_primary_10_1007_s10270_022_00980_8 crossref_primary_10_1016_j_cor_2023_106451 crossref_primary_10_1109_TASE_2024_3421889 crossref_primary_10_3390_math9233030 crossref_primary_10_1016_j_dam_2025_05_039 crossref_primary_10_1016_j_cie_2022_108561 crossref_primary_10_1109_TASE_2019_2952523 crossref_primary_10_1109_TCC_2022_3218813 crossref_primary_10_1080_00207543_2021_1937745 crossref_primary_10_1007_s10951_024_00821_0 crossref_primary_10_1016_j_aei_2025_103543 crossref_primary_10_1080_00207543_2023_2226772 crossref_primary_10_3390_a15120450 crossref_primary_10_1007_s10696_021_09425_8 crossref_primary_10_1109_TASE_2022_3214567 crossref_primary_10_1080_01605682_2019_1595192 crossref_primary_10_1016_j_eswa_2022_117529 crossref_primary_10_1109_TASE_2019_2963285 crossref_primary_10_1016_j_eswa_2024_124452 crossref_primary_10_1016_j_ijepes_2021_107047 crossref_primary_10_1016_j_ifacol_2022_09_389 crossref_primary_10_1049_rpg2_12985 crossref_primary_10_1111_itor_12595 crossref_primary_10_1016_j_comcom_2019_12_033 crossref_primary_10_1016_j_cie_2021_107209 crossref_primary_10_1016_j_cor_2025_106999 crossref_primary_10_1007_s10845_022_02050_8 crossref_primary_10_1177_23998083221120019 crossref_primary_10_1016_j_cor_2020_105069 crossref_primary_10_1080_00207543_2019_1640407 crossref_primary_10_1109_TII_2022_3228682 crossref_primary_10_1016_j_eswa_2024_125294 crossref_primary_10_1061__ASCE_CO_1943_7862_0001990 crossref_primary_10_1007_s10696_025_09630_9 crossref_primary_10_1016_j_ejor_2021_02_012 crossref_primary_10_1016_j_cie_2021_107553 crossref_primary_10_1007_s12532_020_00190_7 crossref_primary_10_1016_j_cie_2022_108544 crossref_primary_10_1007_s00170_020_06176_y crossref_primary_10_1109_ACCESS_2023_3254900 crossref_primary_10_1016_j_cie_2021_107317 crossref_primary_10_1007_s10601_023_09347_2 crossref_primary_10_1080_24725854_2020_1831713 crossref_primary_10_3390_app13106003 crossref_primary_10_1016_j_procs_2023_10_070 crossref_primary_10_1155_2021_8035806 crossref_primary_10_1016_j_cie_2020_106857 crossref_primary_10_1016_j_cie_2025_111099 crossref_primary_10_1016_j_cor_2020_105111 crossref_primary_10_1109_ACCESS_2021_3089275 crossref_primary_10_3390_buildings13071867 crossref_primary_10_1371_journal_pone_0330020 crossref_primary_10_1007_s10951_021_00682_x crossref_primary_10_1016_j_ifacol_2019_11_144
Cites_doi	10.1016/j.cie.2016.11.001 10.1109/LRA.2016.2522096 10.1016/0895-7177(93)90068-A 10.1016/0004-3702(91)90006-6 10.1049/ise.1994.0009 10.1016/j.cie.2017.03.017 10.1016/S0377-2217(96)00170-1 10.1016/j.tre.2016.01.007 10.1287/opre.1060.0371 10.1016/j.ejor.2015.11.020 10.1007/s10951-014-0408-7 10.1007/978-3-642-21311-3_22 10.1007/978-3-540-30201-8_2 10.1109/TIME.1996.555676 10.1007/978-3-319-59776-8_26 10.1109/CIT.2016.42 10.1007/978-3-319-93031-2_28 10.1016/j.cor.2016.04.006 10.1007/978-3-319-44953-1_34 10.1007/978-3-319-23219-5_11 10.1007/978-3-319-33954-2_16 10.1007/3-540-49481-2_30 10.1609/icaps.v26i1.13780 10.1007/978-3-319-18008-3_30 10.1007/978-3-319-93031-2_25 10.1007/978-3-319-33954-2_17 10.1609/icaps.v27i1.13844 10.1007/978-3-642-01929-6_12 10.1061/(ASCE)CO.1943-7862.0001276 10.1613/jair.5306 10.1109/ICIS.2017.7960110 10.1109/WFCS.2017.7991955 10.1109/DASC.2016.7777984 10.1007/978-3-319-44953-1_38 10.1007/978-3-319-93031-2_29
ContentType	Journal Article
Copyright	Springer Science+Business Media, LLC, part of Springer Nature 2018
Copyright_xml	– notice: Springer Science+Business Media, LLC, part of Springer Nature 2018
DBID	AAYXX CITATION
DOI	10.1007/s10601-018-9281-x
DatabaseName	CrossRef
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1572-9354
EndPage	250
ExternalDocumentID	10_1007_s10601_018_9281_x
GroupedDBID	-4Z -59 -5G -BR -EM -Y2 -~C .86 .VR 06D 0VY 1N0 1SB 2.D 203 28- 29F 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EBLON EBS EIOEI EJD ESBYG F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7R Z7X Z83 Z88 Z8M Z8R Z8W Z92 ZMTXR ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION
ID	FETCH-LOGICAL-c288t-6a66babcc801061be77421d66b15bae9bf08f84626fbb6ac746507842c16f57a3
IEDL.DBID	RSV
ISICitedReferencesCount	227
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000430980800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1383-7133
IngestDate	Sat Nov 29 04:16:04 EST 2025 Tue Nov 18 22:32:01 EST 2025 Fri Feb 21 02:33:35 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Keywords	Scheduling Modeling Constraint programming Automatic search
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c288t-6a66babcc801061be77421d66b15bae9bf08f84626fbb6ac746507842c16f57a3
ORCID	0000-0002-4045-8601
PageCount	41
ParticipantIDs	crossref_citationtrail_10_1007_s10601_018_9281_x crossref_primary_10_1007_s10601_018_9281_x springer_journals_10_1007_s10601_018_9281_x
PublicationCentury	2000
PublicationDate	20180400 2018-4-00
PublicationDateYYYYMMDD	2018-04-01
PublicationDate_xml	– month: 4 year: 2018 text: 20180400
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationSubtitle	An International Journal
PublicationTitle	Constraints : an international journal
PublicationTitleAbbrev	Constraints
PublicationYear	2018
Publisher	Springer US
Publisher_xml	– name: Springer US
References	Lazarev, Bronnikov, Gerasimov, Musatova, Petrov, Ponomarev, Kharlamov, Khusnullin, Yadrentsev (CR38) 2016; 63 CR37 CR35 CR34 CR33 CR32 CR31 CR30 Van Hentenryck (CR51) 1999 CR2 CR4 CR6 CR5 CR9 CR49 CR48 CR47 CR46 CR44 Gedik, Kirac, Milburn, Rainwater (CR13) 2017; 107 CR43 CR42 CR41 Tran, Vaquero, Nejat, Beck (CR50) 2017; 58 Qin, Du, Sha (CR45) 2016; 87 Hooker (CR20) 2007; 55 Gedik, Rainwater, Nachtmann, Pohlb (CR14) 2016; 251 CR19 Booth, Tran, Nejat, Beck (CR3) 2016; 1 CR17 CR16 CR15 CR12 CR11 CR10 CR54 CR53 CR52 Cherkassky, Goldberg, Radzic (CR7) 1996; 73 Dechter, Meiri, Pearl (CR8) 1991; 49 Ham, Cakici (CR18) 2016; 102 Aggoun, Beldiceanu (CR1) 1993; 17 CR29 Kolisch, Sprecher (CR26) 1996; 96 CR28 CR27 Le Pape (CR39) 1994; 3 CR25 CR24 CR23 CR22 CR21 Laborie, Rogerie (CR36) 2016; 19 Morton, Pentico (CR40) 1993 R Gedik (9281_CR14) 2016; 251 9281_CR48 9281_CR49 9281_CR11 9281_CR12 9281_CR52 9281_CR53 9281_CR10 9281_CR54 K Booth (9281_CR3) 2016; 1 R Kolisch (9281_CR26) 1996; 96 T Qin (9281_CR45) 2016; 87 R Gedik (9281_CR13) 2017; 107 9281_CR19 P Laborie (9281_CR36) 2016; 19 R Dechter (9281_CR8) 1991; 49 9281_CR15 9281_CR16 9281_CR17 9281_CR4 9281_CR22 9281_CR5 9281_CR23 9281_CR6 9281_CR24 9281_CR25 9281_CR9 JN Hooker (9281_CR20) 2007; 55 9281_CR21 9281_CR2 A Lazarev (9281_CR38) 2016; 63 9281_CR27 9281_CR28 9281_CR29 9281_CR33 9281_CR34 9281_CR35 9281_CR30 B Cherkassky (9281_CR7) 1996; 73 9281_CR31 9281_CR32 A Aggoun (9281_CR1) 1993; 17 P Hentenryck Van (9281_CR51) 1999 9281_CR37 C Le Pape (9281_CR39) 1994; 3 9281_CR44 9281_CR46 T Tran (9281_CR50) 2017; 58 9281_CR47 9281_CR41 A Ham (9281_CR18) 2016; 102 T Morton (9281_CR40) 1993 9281_CR42 9281_CR43
References_xml	– ident: CR22 – volume: 102 start-page: 160 year: 2016 end-page: 165 ident: CR18 article-title: Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.11.001 – ident: CR49 – ident: CR4 – ident: CR16 – ident: CR12 – ident: CR35 – ident: CR29 – ident: CR54 – volume: 1 start-page: 500 year: 2016 end-page: 507 ident: CR3 article-title: Mixed-integer and constraint programming techniques for mobile robot task planning publication-title: IEEE Robotics and Automation Letters doi: 10.1109/LRA.2016.2522096 – volume: 73 start-page: 129 year: 1996 end-page: 174 ident: CR7 article-title: Shortest paths algorithms: theory and experimental evaluation publication-title: Mathematical Programming – ident: CR25 – ident: CR42 – ident: CR21 – ident: CR46 – ident: CR19 – volume: 58 start-page: 523 year: 2017 end-page: 590 ident: CR50 article-title: Robots in retirement homes: applying off-the-shelf planning and scheduling to a team of assistive robots publication-title: Journal of Artificial Intelligence Research – ident: CR15 – ident: CR11 – ident: CR9 – ident: CR32 – volume: 63 start-page: 129 year: 2016 end-page: 154 ident: CR38 article-title: Mathematical modeling of the astronaut training scheduling publication-title: Management of Large Systems – ident: CR5 – year: 1993 ident: CR40 publication-title: Heuristic scheduling systems – volume: 17 start-page: 57 year: 1993 end-page: 73 ident: CR1 article-title: Extending CHIP in order to solve complex scheduling problems publication-title: Journal of Mathematical and Computer Modelling doi: 10.1016/0895-7177(93)90068-A – volume: 49 start-page: 61 issue: 1-3 year: 1991 end-page: 96 ident: CR8 article-title: Temporal constraint networks publication-title: Artificial Intelligence doi: 10.1016/0004-3702(91)90006-6 – volume: 3 start-page: 55 issue: 2 year: 1994 end-page: 66 ident: CR39 article-title: Implementation of resource constraints in ILOG schedule: a library for the development of constraint-based scheduling systems publication-title: Intelligent Systems Engineering doi: 10.1049/ise.1994.0009 – ident: CR43 – ident: CR47 – volume: 107 start-page: 178 year: 2017 end-page: 195 ident: CR13 article-title: A constraint programming approach for the team orienteering problem with time windows publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.03.017 – volume: 96 start-page: 205 year: 1996 end-page: 216 ident: CR26 article-title: PSPLIB - A project scheduling problem library publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00170-1 – ident: CR2 – ident: CR37 – ident: CR53 – volume: 87 start-page: 167 year: 2016 end-page: 185 ident: CR45 article-title: Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth publication-title: Transportation Research doi: 10.1016/j.tre.2016.01.007 – ident: CR30 – ident: CR10 – ident: CR33 – ident: CR6 – ident: CR27 – ident: CR23 – ident: CR44 – ident: CR48 – volume: 55 start-page: 588 issue: 3 year: 2007 end-page: 602 ident: CR20 article-title: Planning and scheduling by logic-based benders decomposition publication-title: Operations Research doi: 10.1287/opre.1060.0371 – ident: CR52 – ident: CR17 – ident: CR31 – year: 1999 ident: CR51 publication-title: The OPL optimization programming language – volume: 251 start-page: 640 year: 2016 end-page: 650 ident: CR14 article-title: Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.11.020 – ident: CR34 – volume: 19 start-page: 391 issue: 4 year: 2016 end-page: 400 ident: CR36 article-title: Temporal linear relaxation in IBM ILOG CP optimizer publication-title: Journal of Scheduling doi: 10.1007/s10951-014-0408-7 – ident: CR28 – ident: CR41 – ident: CR24 – ident: 9281_CR43 – ident: 9281_CR53 doi: 10.1007/978-3-642-21311-3_22 – ident: 9281_CR44 doi: 10.1007/978-3-540-30201-8_2 – ident: 9281_CR24 – volume: 63 start-page: 129 year: 2016 ident: 9281_CR38 publication-title: Management of Large Systems – ident: 9281_CR6 doi: 10.1109/TIME.1996.555676 – volume-title: Heuristic scheduling systems year: 1993 ident: 9281_CR40 – volume: 73 start-page: 129 year: 1996 ident: 9281_CR7 publication-title: Mathematical Programming – ident: 9281_CR5 doi: 10.1007/978-3-319-59776-8_26 – ident: 9281_CR27 – volume-title: The OPL optimization programming language year: 1999 ident: 9281_CR51 – ident: 9281_CR52 – ident: 9281_CR33 – volume: 3 start-page: 55 issue: 2 year: 1994 ident: 9281_CR39 publication-title: Intelligent Systems Engineering doi: 10.1049/ise.1994.0009 – ident: 9281_CR17 doi: 10.1109/CIT.2016.42 – volume: 17 start-page: 57 year: 1993 ident: 9281_CR1 publication-title: Journal of Mathematical and Computer Modelling doi: 10.1016/0895-7177(93)90068-A – volume: 96 start-page: 205 year: 1996 ident: 9281_CR26 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(96)00170-1 – ident: 9281_CR37 – ident: 9281_CR31 doi: 10.1007/978-3-319-93031-2_28 – ident: 9281_CR28 doi: 10.1016/j.cor.2016.04.006 – ident: 9281_CR42 – ident: 9281_CR2 doi: 10.1007/978-3-319-44953-1_34 – ident: 9281_CR11 doi: 10.1007/978-3-319-23219-5_11 – ident: 9281_CR21 – ident: 9281_CR22 doi: 10.1007/978-3-319-33954-2_16 – ident: 9281_CR49 doi: 10.1007/3-540-49481-2_30 – ident: 9281_CR46 – volume: 87 start-page: 167 year: 2016 ident: 9281_CR45 publication-title: Transportation Research doi: 10.1016/j.tre.2016.01.007 – volume: 55 start-page: 588 issue: 3 year: 2007 ident: 9281_CR20 publication-title: Operations Research doi: 10.1287/opre.1060.0371 – volume: 49 start-page: 61 issue: 1-3 year: 1991 ident: 9281_CR8 publication-title: Artificial Intelligence doi: 10.1016/0004-3702(91)90006-6 – ident: 9281_CR10 doi: 10.1609/icaps.v26i1.13780 – ident: 9281_CR54 doi: 10.1007/978-3-319-18008-3_30 – volume: 1 start-page: 500 year: 2016 ident: 9281_CR3 publication-title: IEEE Robotics and Automation Letters doi: 10.1109/LRA.2016.2522096 – volume: 251 start-page: 640 year: 2016 ident: 9281_CR14 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.11.020 – ident: 9281_CR25 doi: 10.1007/978-3-319-93031-2_25 – ident: 9281_CR16 – ident: 9281_CR41 – volume: 102 start-page: 160 year: 2016 ident: 9281_CR18 publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2016.11.001 – ident: 9281_CR12 – ident: 9281_CR23 doi: 10.1007/978-3-319-33954-2_17 – volume: 107 start-page: 178 year: 2017 ident: 9281_CR13 publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2017.03.017 – ident: 9281_CR34 doi: 10.1609/icaps.v27i1.13844 – ident: 9281_CR29 doi: 10.1007/978-3-642-01929-6_12 – ident: 9281_CR35 – ident: 9281_CR47 doi: 10.1061/(ASCE)CO.1943-7862.0001276 – volume: 19 start-page: 391 issue: 4 year: 2016 ident: 9281_CR36 publication-title: Journal of Scheduling doi: 10.1007/s10951-014-0408-7 – volume: 58 start-page: 523 year: 2017 ident: 9281_CR50 publication-title: Journal of Artificial Intelligence Research doi: 10.1613/jair.5306 – ident: 9281_CR4 – ident: 9281_CR19 doi: 10.1109/ICIS.2017.7960110 – ident: 9281_CR30 – ident: 9281_CR9 doi: 10.1109/WFCS.2017.7991955 – ident: 9281_CR48 doi: 10.1109/DASC.2016.7777984 – ident: 9281_CR15 doi: 10.1007/978-3-319-44953-1_38 – ident: 9281_CR32 doi: 10.1007/978-3-319-93031-2_29
SSID	ssj0009734
Score	2.5812612
Snippet	IBM ILOG CP Optimizer is a generic CP-based system to model and solve scheduling problems. It provides an algebraic language with simple mathematical concepts...
SourceID	crossref springer
SourceType	Enrichment Source Index Database Publisher
StartPage	210
SubjectTerms	Artificial Intelligence Computer Science Operations Research/Decision Theory Optimization Topical Collection on 20th Anniversary Issue
Subtitle	20+ years of scheduling with constraints at IBM/ILOG
Title	IBM ILOG CP optimizer for scheduling
URI	https://link.springer.com/article/10.1007/s10601-018-9281-x
Volume	23
WOSCitedRecordID	wos000430980800005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1572-9354 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009734 issn: 1383-7133 databaseCode: RSV dateStart: 19970301 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEB6kevBifWJ9sYeelEA3zSbZoxarBa3FF70tSZpAobbSVhF_vZN011pQQa-b2WWZzOSbj8nMAFQNoobtyYQIRAPCTEqJShOLG-KQDKDRaOrCsAnRbstuN-3kddyT4rZ7kZIMJ_WXYjceqC86KJUxwcBxGdFOem-8vXucd9oVs1QyUi_iGViRyvzuE4tgtJgJDQDTLP_r19ZhLY8no9OZAWzAkh1uQrmY1RDlrrsF1dbZddS6urmIGp1ohOfEU_8d1zFkjZDfIt74svRteGie3zcuST4hgRgq5ZRwxblW2hgZqJ22GMzRuIcP40Qrm2pXkw4jDMqd1lwZwTAgE5JRE3OXCFXfgdJwNLS7EDFcrjHbU84oZup1LR2XBvE7EYalilWgVqgqM3n7cD_FYpDNGx97LWSohcxrIXurwPHnK8-z3hm_CZ8Uus1yN5r8LL33J-l9WKV-c8KFmwMoTccv9hBWzOu0PxkfBfP5AKVNvRg
linkProvider	Springer Nature
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED9kCvri_MT5mYc9KYE1TdP0UYdzw20OnbK3kmQJDHSTbYr413vtWudABX1t0lIud_ndj_sCKBtEDduXAQ0RDSg3EaMqCiweiEMygEqjmUuHTYTttuz1ok5Wxz3Js93zkGR6U38pdhMp9UUDZdKj6DgucwSsJI_v9u5h3mk3nIWSkXrRhIHloczvPrEIRouR0BRgasV__doGrGf-JDmfKcAmLNnhFhTzWQ0kM91tKDcuWqTRvLki1Q4Z4T3xNHjHdXRZCfJbxJukLH0H7muX3WqdZhMSqGFSTqlQQmiljZEptdMWnTnm9fGhF2hlI-0q0qGHwYTTWigTcnTIQsmZ8YQLQuXvQmE4Gto9IByXK9z2lTOKG9_X0glpEL-D0PBI8RJUclHFJmsfnkyxeIznjY8TKcQohTiRQvxWgtPPV55nvTN-23yWyzbOzGjy8-79P-0-gdV6t9WMm4329QGsseSg0uSbQyhMxy_2CFbM63QwGR-nqvQBjS-__A
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA8yRXxxfuL87MOelLA1TdP0UafT4ZwDP9hbSdIEBtqNrYr413vph3OggvjaXEq53PV-Py53h1BdQdTQMfdxANEAUxUSLEJfw4EYIANgNJKYbNhE0OvxwSDsF3NOp-Vt9zIlmdc02C5NSdoYx6bxpfCNZTQYnJVwFwOIXKR2ZpCl63ePs667QZ5WBhqGLRsr05rfvWI-MM1nRbNg067--zPX0GqBM53T3DDW0YJONlC1nOHgFC69ieqdsxun0729dFp9ZwT_j-fhO6wDlHWA90IcsuXqW-ihfXHfusLF5ASsCOcpZoIxKaRSPKN8UgPII24MD11fCh1K0-QGkAdhRkomVEABqAWcEuUy4wfC20aVZJToHeRQWG5SHQujBFWeJ7lhXEFc9wNFQ0FrqFmqLVJFW3E73eIpmjVEtlqIQAuR1UL0VkPHn1vGeU-N34RPSj1HhXtNf5be_ZP0EVrun7ejbqd3vYdWiD2n7E7OPqqkkxd9gJbUazqcTg4zq_oAwJLI4A
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=IBM+ILOG+CP+optimizer+for+scheduling&rft.jtitle=Constraints+%3A+an+international+journal&rft.au=Laborie%2C+Philippe&rft.au=Rogerie%2C+J%C3%A9r%C3%B4me&rft.au=Shaw%2C+Paul&rft.au=Vil%C3%ADm%2C+Petr&rft.date=2018-04-01&rft.issn=1383-7133&rft.eissn=1572-9354&rft.volume=23&rft.issue=2&rft.spage=210&rft.epage=250&rft_id=info:doi/10.1007%2Fs10601-018-9281-x&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10601_018_9281_x
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1383-7133&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1383-7133&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1383-7133&client=summon