Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
•The problem of unrelated parallel machines with an additional resource is considered.•Two mathematical models are proposed: one adapted from the literature, an original one based on strip packing.•Three matheuristic strategies are proposed.•A comprehensive computational and statistical evaluation i...
Saved in:
| Published in | European journal of operational research Vol. 260; no. 2; pp. 482 - 493 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
16.07.2017
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0377-2217 1872-6860 1872-6860 |
| DOI | 10.1016/j.ejor.2017.01.002 |
Cover
| Abstract | •The problem of unrelated parallel machines with an additional resource is considered.•Two mathematical models are proposed: one adapted from the literature, an original one based on strip packing.•Three matheuristic strategies are proposed.•A comprehensive computational and statistical evaluation is carried out.•The model based on strip packing is shown to outperform the model adapted from the literature.•Matheuristic strategies are able to solve larger problems more efficiently and effectively.
In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. The availability of resources is limited and fixed throughout the production horizon. The objective considered is the minimization of the makespan. We model this problem by means of two integer linear programming problems. One of them is based on a model previously proposed in the literature. The other one, which is based on the resemblance to strip packing problems, is an original contribution of this paper. As the models presented are incapable of solving medium-sized instances to optimality, we propose three matheuristic strategies for each of these two models. The algorithms proposed are tested over an extensive computational experience. Results show that the matheuristic strategies significantly outperform the mathematical models. |
|---|---|
| AbstractList | •The problem of unrelated parallel machines with an additional resource is considered.•Two mathematical models are proposed: one adapted from the literature, an original one based on strip packing.•Three matheuristic strategies are proposed.•A comprehensive computational and statistical evaluation is carried out.•The model based on strip packing is shown to outperform the model adapted from the literature.•Matheuristic strategies are able to solve larger problems more efficiently and effectively.
In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. The availability of resources is limited and fixed throughout the production horizon. The objective considered is the minimization of the makespan. We model this problem by means of two integer linear programming problems. One of them is based on a model previously proposed in the literature. The other one, which is based on the resemblance to strip packing problems, is an original contribution of this paper. As the models presented are incapable of solving medium-sized instances to optimality, we propose three matheuristic strategies for each of these two models. The algorithms proposed are tested over an extensive computational experience. Results show that the matheuristic strategies significantly outperform the mathematical models. |
| Author | Perea, Federico Ruiz, Rubén Fanjul-Peyro, Luis |
| Author_xml | – sequence: 1 givenname: Luis orcidid: 0000-0002-0124-132X surname: Fanjul-Peyro fullname: Fanjul-Peyro, Luis email: lfpeyro@hotmail.com – sequence: 2 givenname: Federico surname: Perea fullname: Perea, Federico email: perea@eio.upv.es – sequence: 3 givenname: Rubén surname: Ruiz fullname: Ruiz, Rubén email: rruiz@eio.upv.es |
| BookMark | eNqNkEtLxDAQgIMouD7-gKf8gdaZ1jZd8CLiCxQveg5pMrVZssmSpC7-e7usJw8iDAwD883jO2GHPnhi7AKhRMD2clXSKsSyAhQlYAlQHbAFdqIq2q6FQ7aAWoiiqlAcs5OUVgCADTYLNr4EQy5x5Q1fqzzSFG3KVic-hMjnmk8-klOZDN-oqJwjNzfq0XriSY9kJmf9B9_E0Dta863NI1fG2GyDV45HSmGKmtIZOxqUS3T-k0_Z-_3d2-1j8fz68HR781zoeilyQVqo3rSKTN8Y7JqrTrcdDI0SWiyvln0NuqmNrhGX1VDNDaJBjXM0BF0PWJ-yej938hv1tZ0Plpto1yp-SQS5kyVXcidL7mRJQDnLmqluT-kYUoo0SG2z2v2Qo7Lub7T6hf5r3_Uemt3Tp6Uok7bkNRkbSWdpgv0L_wZr9Zqi |
| CitedBy_id | crossref_primary_10_1109_TSM_2023_3304517 crossref_primary_10_1155_2021_5566002 crossref_primary_10_1016_j_cor_2020_105162 crossref_primary_10_1016_j_cor_2024_106777 crossref_primary_10_1177_0954405420928691 crossref_primary_10_1016_j_eswa_2022_117577 crossref_primary_10_1590_0101_7438_2020_040_00218849 crossref_primary_10_1016_j_cor_2019_06_007 crossref_primary_10_1016_j_ins_2018_09_019 crossref_primary_10_1016_j_tre_2024_103826 crossref_primary_10_1016_j_knosys_2019_02_005 crossref_primary_10_1287_ijoc_2021_1113 crossref_primary_10_1016_j_cor_2022_106010 crossref_primary_10_1016_j_ejco_2022_100034 crossref_primary_10_1007_s10845_020_01597_8 crossref_primary_10_1016_j_ejor_2017_10_064 crossref_primary_10_1007_s12063_021_00233_9 crossref_primary_10_3390_sym12091460 crossref_primary_10_3233_JIFS_213473 crossref_primary_10_1007_s10479_019_03212_3 crossref_primary_10_35341_afet_1267389 crossref_primary_10_1016_j_cie_2024_110290 crossref_primary_10_1016_j_ejor_2022_03_045 crossref_primary_10_1016_j_cor_2018_12_016 crossref_primary_10_1016_j_eswa_2019_112959 crossref_primary_10_3390_math9222955 crossref_primary_10_1007_s10951_024_00809_w crossref_primary_10_1016_j_jclepro_2019_119428 crossref_primary_10_1016_j_ejor_2018_05_056 crossref_primary_10_1049_cim2_12120 crossref_primary_10_1016_j_cie_2024_109900 crossref_primary_10_3390_jmse11081505 crossref_primary_10_47495_okufbed_779834 crossref_primary_10_1007_s11227_025_07030_2 crossref_primary_10_1016_j_ejor_2024_08_011 crossref_primary_10_1016_j_cor_2021_105625 crossref_primary_10_1080_00207543_2019_1661539 crossref_primary_10_1016_j_ejor_2024_08_010 crossref_primary_10_3390_s22082844 crossref_primary_10_1016_j_cor_2018_04_021 crossref_primary_10_1080_00207543_2020_1777481 crossref_primary_10_1007_s11750_020_00589_4 crossref_primary_10_1016_j_eswa_2017_09_054 crossref_primary_10_1016_j_eswax_2020_100022 crossref_primary_10_1016_j_cor_2023_106192 crossref_primary_10_1007_s10878_020_00607_y crossref_primary_10_1007_s10479_022_05117_0 crossref_primary_10_1016_j_cie_2020_106939 crossref_primary_10_1016_j_cor_2023_106504 crossref_primary_10_3390_designs9020026 crossref_primary_10_1080_00207543_2021_1885068 crossref_primary_10_1007_s11750_018_00494_x crossref_primary_10_3390_sym14071380 crossref_primary_10_1007_s11750_020_00574_x crossref_primary_10_3390_app14156736 crossref_primary_10_1007_s10100_019_00655_8 crossref_primary_10_1080_00207543_2022_2121869 crossref_primary_10_1007_s10479_024_05938_1 crossref_primary_10_1016_j_jmsy_2020_06_006 crossref_primary_10_1080_01605682_2017_1415645 crossref_primary_10_1007_s40314_019_0789_5 crossref_primary_10_1016_j_asoc_2024_111694 crossref_primary_10_1080_21681015_2023_2167875 crossref_primary_10_1080_00207543_2022_2135629 crossref_primary_10_1016_j_ejor_2024_07_030 crossref_primary_10_1080_00207543_2020_1781278 crossref_primary_10_1109_TVT_2020_3046304 crossref_primary_10_1007_s11227_020_03516_3 crossref_primary_10_1016_j_cor_2018_07_007 crossref_primary_10_1080_01605682_2023_2233555 crossref_primary_10_1007_s10479_024_06283_z crossref_primary_10_3390_systems12020037 crossref_primary_10_1007_s11750_021_00610_4 crossref_primary_10_1007_s10951_021_00718_2 crossref_primary_10_1109_TII_2020_3012162 crossref_primary_10_1016_j_cie_2024_110086 crossref_primary_10_1007_s10729_023_09642_7 crossref_primary_10_1109_ACCESS_2018_2872110 crossref_primary_10_1007_s10462_022_10247_9 crossref_primary_10_1016_j_cor_2022_105936 crossref_primary_10_1016_j_omega_2021_102581 crossref_primary_10_1016_j_promfg_2020_01_451 crossref_primary_10_1109_TSMC_2018_2799740 crossref_primary_10_1016_j_ejor_2025_03_022 crossref_primary_10_32604_cmc_2024_054473 crossref_primary_10_1016_j_asoc_2021_107521 crossref_primary_10_1109_ACCESS_2018_2840512 crossref_primary_10_3390_math10142431 crossref_primary_10_1177_1687814019898347 crossref_primary_10_1007_s10489_022_04097_9 crossref_primary_10_1016_j_cor_2021_105308 crossref_primary_10_1016_j_cor_2022_105704 crossref_primary_10_1016_j_ijpe_2023_108977 crossref_primary_10_1080_00207543_2017_1421781 crossref_primary_10_1016_j_cie_2020_106505 crossref_primary_10_25077_josi_v21_n2_p97_105_2022 crossref_primary_10_1016_j_knosys_2022_108193 crossref_primary_10_1016_j_omega_2021_102431 crossref_primary_10_1016_j_apm_2021_01_017 crossref_primary_10_1016_j_omega_2021_102432 crossref_primary_10_1016_j_swevo_2021_101016 crossref_primary_10_1080_00207543_2024_2334419 crossref_primary_10_1016_j_ejor_2020_10_052 crossref_primary_10_1155_2021_8166343 crossref_primary_10_17341_gazimmfd_1099034 crossref_primary_10_1016_j_cor_2020_105115 crossref_primary_10_1016_j_cor_2024_106968 crossref_primary_10_1016_j_cie_2024_110261 crossref_primary_10_3390_sym16020203 crossref_primary_10_1007_s12597_022_00587_z crossref_primary_10_1016_j_cie_2024_110828 crossref_primary_10_1016_j_cor_2019_07_016 crossref_primary_10_1080_00207543_2019_1672900 |
| Cites_doi | 10.1016/j.ejor.2015.04.004 10.1023/A:1021569406280 10.1007/s00170-011-3454-8 10.1016/j.orl.2007.08.001 10.1007/s10951-015-0422-4 10.1016/S0166-218X(96)00087-X 10.1016/0166-218X(83)90012-4 10.1016/j.ejor.2010.03.030 10.1016/S0166-218X(03)00433-5 10.1007/BF00263292 10.1016/S0377-2217(02)00246-1 10.1080/07408170008963887 10.1016/S0305-0548(98)00054-9 10.1109/TAES.2011.5937273 10.1016/j.ejor.2013.02.042 10.1007/s10107-006-0059-3 10.1016/j.ejor.2004.04.015 10.1080/03052151003759117 10.1016/j.cor.2013.11.016 10.1007/s10951-011-0231-3 10.1111/itor.12103 10.1016/S0167-5060(08)70743-X 10.1016/j.cor.2010.05.005 10.1016/S0377-2217(02)00123-6 10.1287/mnsc.6.1.1 10.1016/j.ejor.2014.11.036 10.1007/978-3-642-21311-3_10 10.1016/j.cie.2012.03.018 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION ADTOC UNPAY |
| DOI | 10.1016/j.ejor.2017.01.002 |
| DatabaseName | CrossRef Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 493 |
| ExternalDocumentID | 10.1016/j.ejor.2017.01.002 10_1016_j_ejor_2017_01_002 S0377221717300073 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ AAAKG AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD ADTOC UNPAY |
| ID | FETCH-LOGICAL-c397t-ec7abd6aedb5d18548c680f5a7c7949b30c53dc31192f2185751c11c15e08b013 |
| IEDL.DBID | .~1 |
| ISSN | 0377-2217 1872-6860 |
| IngestDate | Sun Oct 26 04:16:13 EDT 2025 Wed Oct 01 04:08:33 EDT 2025 Thu Apr 24 23:13:16 EDT 2025 Fri Feb 23 02:27:38 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Parallel machine problem Scheduling Makespan Additional resources Matheuristics |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c397t-ec7abd6aedb5d18548c680f5a7c7949b30c53dc31192f2185751c11c15e08b013 |
| ORCID | 0000-0002-0124-132X |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://www.sciencedirect.com/science/article/pii/S0377221717300073 |
| PageCount | 12 |
| ParticipantIDs | unpaywall_primary_10_1016_j_ejor_2017_01_002 crossref_citationtrail_10_1016_j_ejor_2017_01_002 crossref_primary_10_1016_j_ejor_2017_01_002 elsevier_sciencedirect_doi_10_1016_j_ejor_2017_01_002 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2017-07-16 |
| PublicationDateYYYYMMDD | 2017-07-16 |
| PublicationDate_xml | – month: 07 year: 2017 text: 2017-07-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Lodi, Martello, Monaci (bib0023) 2002; 141 Perea, de Waard (bib0027) 2011; 47 Billaut, Croce, Grosso (bib0002) 2015; 243 Błażewicz, Kubiak, Röck, Szwarcfiter (bib0004) 1987; 24 Daniels, Hua, Webster (bib0007) 1999; 26 Edis, Oguz (bib0009) 2012; 63 Fanjul-Peyro, Ruiz (bib0013) 2010; 207 Stefanello, de Araújo, Müller (bib0031) 2015; 22 Kravchenko, Werner (bib0021) 2011; 14 Croce, Salassa, T’kindt (bib0006) 2014; 45 Kellerer, Strusevich (bib0020) 2003; 133 Sule (bib0032) 2008 Mokotoff, Jimeno (bib0026) 2002; 117 Kellerer, Strusevich (bib0019) 2003; 147 Edis, Oguz (bib0008) 2011; vol. 6697 Ventura, Daecheol (bib0034) 2000; 32 Grigoriev, Sviridenko, Uetz (bib0016) 2005; Vol. 3509 Grigoriev, Sviridenko, Uetz (bib0017) 2007; 110 Toffolo, Santos, Carvalho, Soares (bib0033) 2015; 19 Ghirardi, Potts (bib0015) 2005; 165 Błażewicz, Lenstra, Rinnooy Kan (bib0005) 1983; 5 Allahverdi (bib0001) 2015; 246 Fanjul-Peyro, Ruiz (bib0014) 2011; 38 Pinedo (bib0029) 2016 Edis, Oguz, Ozkarahan (bib0010) 2013; 230 Błażewicz, Ecker, Pesch, Schmidt, Weglarz (bib0003) 2007 Edis, Ozkarahan (bib0012) 2012; 9 Pinedo (bib0028) 2005 Kellerer (bib0018) 2008; 36 Martello, Soumis, Toth (bib0024) 1997; 75 Edis, Ozkarahan (bib0011) 2011; 43 McNaughton (bib0025) 1959; 6 Słowiński (bib0030) 1980; 31 Lenstra, Rinnooy Kan, Brucker (bib0022) 1977; 1 Grigoriev (10.1016/j.ejor.2017.01.002_bib0017) 2007; 110 Martello (10.1016/j.ejor.2017.01.002_bib0024) 1997; 75 Pinedo (10.1016/j.ejor.2017.01.002_bib0029) 2016 Sule (10.1016/j.ejor.2017.01.002_bib0032) 2008 Błażewicz (10.1016/j.ejor.2017.01.002_bib0004) 1987; 24 Słowiński (10.1016/j.ejor.2017.01.002_bib0030) 1980; 31 Edis (10.1016/j.ejor.2017.01.002_bib0011) 2011; 43 Billaut (10.1016/j.ejor.2017.01.002_bib0002) 2015; 243 Kellerer (10.1016/j.ejor.2017.01.002_bib0020) 2003; 133 Błażewicz (10.1016/j.ejor.2017.01.002_bib0005) 1983; 5 Toffolo (10.1016/j.ejor.2017.01.002_bib0033) 2015; 19 Edis (10.1016/j.ejor.2017.01.002_bib0008) 2011; vol. 6697 Daniels (10.1016/j.ejor.2017.01.002_bib0007) 1999; 26 Fanjul-Peyro (10.1016/j.ejor.2017.01.002_bib0013) 2010; 207 Kravchenko (10.1016/j.ejor.2017.01.002_bib0021) 2011; 14 Kellerer (10.1016/j.ejor.2017.01.002_bib0018) 2008; 36 Grigoriev (10.1016/j.ejor.2017.01.002_bib0016) 2005; Vol. 3509 Ventura (10.1016/j.ejor.2017.01.002_bib0034) 2000; 32 Allahverdi (10.1016/j.ejor.2017.01.002_bib0001) 2015; 246 Lenstra (10.1016/j.ejor.2017.01.002_bib0022) 1977; 1 Edis (10.1016/j.ejor.2017.01.002_bib0009) 2012; 63 Edis (10.1016/j.ejor.2017.01.002_bib0010) 2013; 230 Edis (10.1016/j.ejor.2017.01.002_bib0012) 2012; 9 Ghirardi (10.1016/j.ejor.2017.01.002_bib0015) 2005; 165 Lodi (10.1016/j.ejor.2017.01.002_bib0023) 2002; 141 Croce (10.1016/j.ejor.2017.01.002_bib0006) 2014; 45 Kellerer (10.1016/j.ejor.2017.01.002_bib0019) 2003; 147 Pinedo (10.1016/j.ejor.2017.01.002_bib0028) 2005 McNaughton (10.1016/j.ejor.2017.01.002_bib0025) 1959; 6 Perea (10.1016/j.ejor.2017.01.002_bib0027) 2011; 47 Błażewicz (10.1016/j.ejor.2017.01.002_bib0003) 2007 Mokotoff (10.1016/j.ejor.2017.01.002_bib0026) 2002; 117 Stefanello (10.1016/j.ejor.2017.01.002_bib0031) 2015; 22 Fanjul-Peyro (10.1016/j.ejor.2017.01.002_bib0014) 2011; 38 |
| References_xml | – volume: 243 start-page: 75 year: 2015 end-page: 81 ident: bib0002 article-title: A single machine scheduling problem with two-dimensional vector packing constraints publication-title: European Journal of Operational Research – volume: 36 start-page: 157 year: 2008 end-page: 159 ident: bib0018 article-title: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times publication-title: Operations Research Letters – volume: 31 start-page: 711 year: 1980 end-page: 723 ident: bib0030 article-title: Two approaches to problems of resource allocation among project activities, a comparative study publication-title: Journal of the Operational Research Society – volume: 14 start-page: 435 year: 2011 end-page: 444 ident: bib0021 article-title: Parallel machine problems with equal processing times: A survey publication-title: Journal of Scheduling – volume: 117 start-page: 133 year: 2002 end-page: 150 ident: bib0026 article-title: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem publication-title: Annals of Operations Research – volume: 22 start-page: 149 year: 2015 end-page: 167 ident: bib0031 article-title: Matheuristics for the capacitated p-median problem publication-title: International Transactions in Operational Research – volume: 6 start-page: 1 year: 1959 end-page: 12 ident: bib0025 article-title: Scheduling with deadlines and loss functions publication-title: Management Science – volume: 26 start-page: 143 year: 1999 end-page: 155 ident: bib0007 article-title: Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment publication-title: Computers & Operations Research – volume: 246 start-page: 345 year: 2015 end-page: 378 ident: bib0001 article-title: The third comprehensive survey on scheduling problems with setup times/costs publication-title: European Journal of Operational Research – volume: 207 start-page: 55 year: 2010 end-page: 69 ident: bib0013 article-title: Iterated greedy local search methods for unrelated parallel machine scheduling publication-title: European Journal of Operational Research – volume: 133 start-page: 45 year: 2003 end-page: 68 ident: bib0020 article-title: Scheduling problems for parallel dedicated machines under multiple resource constraints publication-title: Discrete Applied Mathematics – year: 2008 ident: bib0032 publication-title: Production planning and industrial scheduling: examples, case studies and applications – volume: 19 start-page: 295 year: 2015 end-page: 307 ident: bib0033 article-title: An integer programming approach to the multimode resource-constrained multiproject scheduling problem publication-title: Journal of Scheduling – year: 2005 ident: bib0028 article-title: Planning and scheduling in manufacturing and services publication-title: Springer series in operations research – volume: 75 start-page: 169 year: 1997 end-page: 188 ident: bib0024 article-title: Exact and approximation algorithms for makespan minimization on unrelated parallel machines publication-title: Discrete Applied Mathematics – volume: 110 start-page: 209 year: 2007 end-page: 228 ident: bib0017 article-title: Machine scheduling with resource dependent processing times publication-title: Mathematical Programming Series B – volume: 45 start-page: 7 year: 2014 end-page: 11 ident: bib0006 article-title: A hybrid heuristic approach for single machine scheduling with release times publication-title: Computers & Operations Research – volume: 1 start-page: 343 year: 1977 end-page: 362 ident: bib0022 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics – volume: 32 start-page: 147 year: 2000 end-page: 153 ident: bib0034 article-title: Parallel machine scheduling about an unrestricted due date and additional resource constraints publication-title: IIE Transactions – volume: 24 start-page: 513 year: 1987 end-page: 524 ident: bib0004 article-title: Minimizing mean flow-time with parallel processors and resource constraints publication-title: Acta Informatica – year: 2007 ident: bib0003 publication-title: Handbook on scheduling – volume: 47 start-page: 1915 year: 2011 end-page: 1925 ident: bib0027 article-title: Greedy and k-greedy algorithms for multidimensional data association publication-title: IEEE Transactions on Aerospace and Electronic Systems – volume: 43 start-page: 135 year: 2011 end-page: 157 ident: bib0011 article-title: A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions publication-title: Engineering Optimization – year: 2016 ident: bib0029 publication-title: Scheduling: Theory, algorithms and systems – volume: 63 start-page: 433 year: 2012 end-page: 447 ident: bib0009 article-title: Parallel machine scheduling with flexible resources publication-title: Computers and Industrial Engineering – volume: 147 start-page: 345 year: 2003 end-page: 364 ident: bib0019 article-title: Scheduling parallel dedicated machines under a single non-shared resource publication-title: European Journal of Operational Research – volume: vol. 6697 start-page: 92 year: 2011 end-page: 98 ident: bib0008 article-title: Parallel machine scheduling with additional resources: A Lagrangian-based constraint programming approach publication-title: Lecture notes in computer science, CPAIOR 2011 – volume: 141 start-page: 241 year: 2002 end-page: 252 ident: bib0023 article-title: Two-dimensional packing problems: A survey publication-title: European Journal of Operational Research – volume: 38 start-page: 301 year: 2011 end-page: 309 ident: bib0014 article-title: Size-reduction heuristics for the unrelated parallel machines scheduling problem publication-title: Computers & Operations Research – volume: 230 start-page: 449 year: 2013 end-page: 463 ident: bib0010 article-title: Parallel machine scheduling with additional resources: Notation, classification, models and solution methods publication-title: European Journal of Operational Research – volume: 5 start-page: 11 year: 1983 end-page: 24 ident: bib0005 article-title: Scheduling subject to resource constraints: classification and complexity publication-title: Discrete Applied Mathematics – volume: 9 start-page: 1141 year: 2012 end-page: 1153 ident: bib0012 article-title: Solution approaches for a real-life resource constrained parallel machine scheduling problem publication-title: International Journal of Advanced Manufacturing Technology – volume: 165 start-page: 457 year: 2005 end-page: 467 ident: bib0015 article-title: Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach publication-title: European Journal of Operational Research – volume: Vol. 3509 start-page: 182 year: 2005 end-page: 195 ident: bib0016 article-title: Unrelated parallel machine scheduling with resource dependent processing publication-title: TIMES, Proceedings of the 11th conference on integer programming and combinatorial optimization – volume: 246 start-page: 345 issue: 2 year: 2015 ident: 10.1016/j.ejor.2017.01.002_bib0001 article-title: The third comprehensive survey on scheduling problems with setup times/costs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.04.004 – volume: 117 start-page: 133 issue: 1–4 year: 2002 ident: 10.1016/j.ejor.2017.01.002_bib0026 article-title: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem publication-title: Annals of Operations Research doi: 10.1023/A:1021569406280 – year: 2005 ident: 10.1016/j.ejor.2017.01.002_bib0028 article-title: Planning and scheduling in manufacturing and services – volume: 9 start-page: 1141 issue: 12 year: 2012 ident: 10.1016/j.ejor.2017.01.002_bib0012 article-title: Solution approaches for a real-life resource constrained parallel machine scheduling problem publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-011-3454-8 – volume: 36 start-page: 157 issue: 2 year: 2008 ident: 10.1016/j.ejor.2017.01.002_bib0018 article-title: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times publication-title: Operations Research Letters doi: 10.1016/j.orl.2007.08.001 – volume: 19 start-page: 295 issue: 3 year: 2015 ident: 10.1016/j.ejor.2017.01.002_bib0033 article-title: An integer programming approach to the multimode resource-constrained multiproject scheduling problem publication-title: Journal of Scheduling doi: 10.1007/s10951-015-0422-4 – volume: 75 start-page: 169 issue: 2 year: 1997 ident: 10.1016/j.ejor.2017.01.002_bib0024 article-title: Exact and approximation algorithms for makespan minimization on unrelated parallel machines publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(96)00087-X – volume: 5 start-page: 11 issue: 1 year: 1983 ident: 10.1016/j.ejor.2017.01.002_bib0005 article-title: Scheduling subject to resource constraints: classification and complexity publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(83)90012-4 – volume: 207 start-page: 55 issue: 1 year: 2010 ident: 10.1016/j.ejor.2017.01.002_bib0013 article-title: Iterated greedy local search methods for unrelated parallel machine scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.03.030 – year: 2016 ident: 10.1016/j.ejor.2017.01.002_bib0029 – volume: 133 start-page: 45 issue: 1–3 year: 2003 ident: 10.1016/j.ejor.2017.01.002_bib0020 article-title: Scheduling problems for parallel dedicated machines under multiple resource constraints publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(03)00433-5 – volume: 31 start-page: 711 issue: 8 year: 1980 ident: 10.1016/j.ejor.2017.01.002_bib0030 article-title: Two approaches to problems of resource allocation among project activities, a comparative study publication-title: Journal of the Operational Research Society – volume: 24 start-page: 513 issue: 5 year: 1987 ident: 10.1016/j.ejor.2017.01.002_bib0004 article-title: Minimizing mean flow-time with parallel processors and resource constraints publication-title: Acta Informatica doi: 10.1007/BF00263292 – volume: 147 start-page: 345 issue: 2 year: 2003 ident: 10.1016/j.ejor.2017.01.002_bib0019 article-title: Scheduling parallel dedicated machines under a single non-shared resource publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00246-1 – year: 2007 ident: 10.1016/j.ejor.2017.01.002_bib0003 – volume: Vol. 3509 start-page: 182 year: 2005 ident: 10.1016/j.ejor.2017.01.002_bib0016 article-title: Unrelated parallel machine scheduling with resource dependent processing – volume: 32 start-page: 147 issue: 2 year: 2000 ident: 10.1016/j.ejor.2017.01.002_bib0034 article-title: Parallel machine scheduling about an unrestricted due date and additional resource constraints publication-title: IIE Transactions doi: 10.1080/07408170008963887 – volume: 26 start-page: 143 issue: 2 year: 1999 ident: 10.1016/j.ejor.2017.01.002_bib0007 article-title: Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(98)00054-9 – volume: 47 start-page: 1915 issue: 3 year: 2011 ident: 10.1016/j.ejor.2017.01.002_bib0027 article-title: Greedy and k-greedy algorithms for multidimensional data association publication-title: IEEE Transactions on Aerospace and Electronic Systems doi: 10.1109/TAES.2011.5937273 – volume: 230 start-page: 449 issue: 3 year: 2013 ident: 10.1016/j.ejor.2017.01.002_bib0010 article-title: Parallel machine scheduling with additional resources: Notation, classification, models and solution methods publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.02.042 – volume: 110 start-page: 209 issue: 1 year: 2007 ident: 10.1016/j.ejor.2017.01.002_bib0017 article-title: Machine scheduling with resource dependent processing times publication-title: Mathematical Programming Series B doi: 10.1007/s10107-006-0059-3 – volume: 165 start-page: 457 issue: 2 year: 2005 ident: 10.1016/j.ejor.2017.01.002_bib0015 article-title: Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.04.015 – volume: 43 start-page: 135 issue: 2 year: 2011 ident: 10.1016/j.ejor.2017.01.002_bib0011 article-title: A combined integer/constraint programming approach to a resource-constrained parallel machine scheduling problem with machine eligibility restrictions publication-title: Engineering Optimization doi: 10.1080/03052151003759117 – year: 2008 ident: 10.1016/j.ejor.2017.01.002_bib0032 – volume: 45 start-page: 7 year: 2014 ident: 10.1016/j.ejor.2017.01.002_bib0006 article-title: A hybrid heuristic approach for single machine scheduling with release times publication-title: Computers & Operations Research doi: 10.1016/j.cor.2013.11.016 – volume: 14 start-page: 435 issue: 5 year: 2011 ident: 10.1016/j.ejor.2017.01.002_bib0021 article-title: Parallel machine problems with equal processing times: A survey publication-title: Journal of Scheduling doi: 10.1007/s10951-011-0231-3 – volume: 22 start-page: 149 issue: 1 year: 2015 ident: 10.1016/j.ejor.2017.01.002_bib0031 article-title: Matheuristics for the capacitated p-median problem publication-title: International Transactions in Operational Research doi: 10.1111/itor.12103 – volume: 1 start-page: 343 year: 1977 ident: 10.1016/j.ejor.2017.01.002_bib0022 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70743-X – volume: 38 start-page: 301 issue: 1 year: 2011 ident: 10.1016/j.ejor.2017.01.002_bib0014 article-title: Size-reduction heuristics for the unrelated parallel machines scheduling problem publication-title: Computers & Operations Research doi: 10.1016/j.cor.2010.05.005 – volume: 141 start-page: 241 issue: 2 year: 2002 ident: 10.1016/j.ejor.2017.01.002_bib0023 article-title: Two-dimensional packing problems: A survey publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00123-6 – volume: 6 start-page: 1 issue: 1 year: 1959 ident: 10.1016/j.ejor.2017.01.002_bib0025 article-title: Scheduling with deadlines and loss functions publication-title: Management Science doi: 10.1287/mnsc.6.1.1 – volume: 243 start-page: 75 issue: 1 year: 2015 ident: 10.1016/j.ejor.2017.01.002_bib0002 article-title: A single machine scheduling problem with two-dimensional vector packing constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.11.036 – volume: vol. 6697 start-page: 92 year: 2011 ident: 10.1016/j.ejor.2017.01.002_bib0008 article-title: Parallel machine scheduling with additional resources: A Lagrangian-based constraint programming approach doi: 10.1007/978-3-642-21311-3_10 – volume: 63 start-page: 433 issue: 2 year: 2012 ident: 10.1016/j.ejor.2017.01.002_bib0009 article-title: Parallel machine scheduling with flexible resources publication-title: Computers and Industrial Engineering doi: 10.1016/j.cie.2012.03.018 |
| SSID | ssj0001515 |
| Score | 2.5837507 |
| Snippet | •The problem of unrelated parallel machines with an additional resource is considered.•Two mathematical models are proposed: one adapted from the literature,... |
| SourceID | unpaywall crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 482 |
| SubjectTerms | Additional resources Makespan Matheuristics Parallel machine problem Scheduling |
| SummonAdditionalLinks | – databaseName: Unpaywall dbid: UNPAY link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50BR8HH6vimxy8ad1k2_RxFFFEUARd0FNJkyyu1rroFtFf70ybioqIIvSSMqWPmU6-TGa-Adj2uVZUQ-J1o37XC3QgPCVwyPsclxMyyXjVJeL0LDzuBSdX8moMDppaGEqrdL6_9umVt3ZnOu5rdoaDQeeC-4gMEVELolxHSx2HiVAiIG_BRO_sfP-62j-IIo9kaNkVR10vjEPuSmfqLC97-0CsoCKqyDtdcOWb6WmqLIbq5Vnl-Yfp52gOTPPgddbJ3V45yvb06xdOx3--2TzMOnjK9mu5BRizRRsmm-z4Nsw1XSCYcwptmPlAabgIN9RcLX9iqjDsntBl6aigGaJjhmNWFlX9jDWMaMfz3OYoSBmdluFKG2c-KpBnrtENozgxo6SnOmbJHt12w9MS9I4OLw-OPdfNwdOIeUae1ZHKTKisyaRBlBDEOox5X6pIo09IMrQa6RvtC8Sc_S5RVEmhBR7S8piitcvQKh4KuwIsEdIkIjA688OAmyQLAuUrZTSnsmIZr4JolJhqR3VOHTfytMlpu01J8SkpPuUiRcWvws77NcOa6ONHadnYRvpJqSnORD9et_tuSL-4zdrfxNdhmkYUehbhBrRGj6XdRMw0yrbcP_EGli4VQQ priority: 102 providerName: Unpaywall |
| Title | Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources |
| URI | https://dx.doi.org/10.1016/j.ejor.2017.01.002 https://www.sciencedirect.com/science/article/pii/S0377221717300073 |
| UnpaywallVersion | publishedVersion |
| Volume | 260 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier) customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: GBLVA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Complete Freedom Collection [SCCMFC] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: ACRLP dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals [SCFCJ] customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIKHN dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVESC databaseName: ScienceDirect (Elsevier) customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: .~1 dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVLSH databaseName: Elsevier Journals customDbUrl: mediaType: online eissn: 1872-6860 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AKRWK dateStart: 19770101 isFulltext: true providerName: Library Specific Holdings |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB5EwcfBx6r4JgdvWjfZJu32uIiyKi6CLuippEkWlVoX3UW8-NudaVMfICJCoaQkpGSSzJfJzDcAuyE3mmJIglY8aAXSSBFogUU-4HicUEnGyywR572o25en1-p6Ag7rWBhyq_R7f7Wnl7u1_9L0o9kc3t01L3mIyBARtSDKdZypFMEuY8picPD26eZBCru8SYjjgGr7wJnKx8vdPxInqIhL6k5vWvlBOc2Mi6F-fdF5_kX5HC_CvEeNrFP92BJMuKIB07XTegMW6uQMzK_VBsx9YRpchlvKeZY_M11Y9kCgb-wZmhmCVoZlNi7KsBZnGbGB57nLsSI5WjqGB2BUSBS3znz-GUbmW0a-SJUpkT35W4DnFegfH10ddgOfZCEwCEVGgTOxzmyknc2UReUt2yZq84HSscGlmmQoTBVaEwqEgoMWMUcpYQQ-yvE2GVFXYbJ4LNwasEQomwhpTRZGktskk1KHWlvDKdpXtddB1KObGs9ATokw8rR2NbtPSSIpSSTlIkWJrMPeR5thxb_xa21VCy39NotSVBC_ttv_kPAfutn4ZzebMEslMg2LaAsmR09jt42YZpTtlJN2B6Y6J2fdHr77vYvOzTvDQ_gM |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3LS_QwEB98gI-Dj_UTn585eNO6yTZpt0cRZf18XFTwFtIky6fUuugu4sW_3Zk29QEiIvSSNiElk2R-mcz8BmA75tZQDEnUSfudSFopIiOwyPscjxMqy3mVJeLsPOldyX_X6noMDppYGHKrDHt_vadXu3V40w6j2R7c3LQveIzIEBG1IMp1nKnjMClVJ6UT2N7Lu58HaezqKiFNI6oeImdqJy9_e0-koCKtuDuDbeUL7TQ9Kgfm-ckUxQftc7QAcwE2sv36zxZhzJctmGq81lsw32RnYGGxtmD2A9XgEvynpGfFIzOlY3eE-kaBopkhamVYZqOyimvxjhEdeFH4AiuSp6VneAJGjUSB6ywkoGFkv2XkjFTbEtlDuAZ4_ANXR4eXB70oZFmILGKRYeRtanKXGO9y5VB7y65NuryvTGpxrWY5SlPFzsYCsWC_Q9RRSliBj_K8S1bUZZgo70u_AiwTymVCOpvHieQuy6U0sTHOcgr3Vd1VEM3oahsoyCkTRqEbX7NbTRLRJBHNhUaJrMLOW5tBTcDxbW3VCE1_mkYaNcS37XbfJPyDbtZ-2c0WTPcuz0716fH5yTrM0BeyE4tkAyaGDyO_iQBnmP-tJvAru0v38Q |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEB50BR8HH6vimxy8ad1k2_RxFFFEUARd0FNJkyyu1rroFtFf70ybioqIIvSSMqWPmU6-TGa-Adj2uVZUQ-J1o37XC3QgPCVwyPsclxMyyXjVJeL0LDzuBSdX8moMDppaGEqrdL6_9umVt3ZnOu5rdoaDQeeC-4gMEVELolxHSx2HiVAiIG_BRO_sfP-62j-IIo9kaNkVR10vjEPuSmfqLC97-0CsoCKqyDtdcOWb6WmqLIbq5Vnl-Yfp52gOTPPgddbJ3V45yvb06xdOx3--2TzMOnjK9mu5BRizRRsmm-z4Nsw1XSCYcwptmPlAabgIN9RcLX9iqjDsntBl6aigGaJjhmNWFlX9jDWMaMfz3OYoSBmdluFKG2c-KpBnrtENozgxo6SnOmbJHt12w9MS9I4OLw-OPdfNwdOIeUae1ZHKTKisyaRBlBDEOox5X6pIo09IMrQa6RvtC8Sc_S5RVEmhBR7S8piitcvQKh4KuwIsEdIkIjA688OAmyQLAuUrZTSnsmIZr4JolJhqR3VOHTfytMlpu01J8SkpPuUiRcWvws77NcOa6ONHadnYRvpJqSnORD9et_tuSL-4zdrfxNdhmkYUehbhBrRGj6XdRMw0yrbcP_EGli4VQQ |
| 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=Models+and+matheuristics+for+the+unrelated+parallel+machine+scheduling+problem+with+additional+resources&rft.jtitle=European+journal+of+operational+research&rft.au=Fanjul-Peyro%2C+Luis&rft.au=Perea%2C+Federico&rft.au=Ruiz%2C+Rub%C3%A9n&rft.date=2017-07-16&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=260&rft.issue=2&rft.spage=482&rft.epage=493&rft_id=info:doi/10.1016%2Fj.ejor.2017.01.002&rft.externalDocID=S0377221717300073 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon |