Logic-based benders decomposition for scheduling a batching machine
•A generalization of single batching machine scheduling with lateness objective.•A novel logic-based Benders decomposition algorithm.•The algorithm finds new best upper bounds in short time on literature instances.•The algorithm finds high-quality solutions on new instances from the AS/RS context. T...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research Jg. 113; S. 104777 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article Paper |
| Sprache: | Englisch |
| Veröffentlicht: |
New York
Elsevier Ltd
01.01.2020
Pergamon Press Inc Federal Reserve Bank of St. Louis |
| Schlagworte: | |
| ISSN: | 0305-0548, 1873-765X, 0305-0548 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •A generalization of single batching machine scheduling with lateness objective.•A novel logic-based Benders decomposition algorithm.•The algorithm finds new best upper bounds in short time on literature instances.•The algorithm finds high-quality solutions on new instances from the AS/RS context.
This paper investigates the problem of scheduling a set of jobs on a single batching machine to minimize the maximum lateness, where jobs may be subject to precedence constraints and incompatibilities. Single batching machine scheduling has many applications, but this study is particularly motivated by single crane scheduling in an automated storage and retrieval system (AS/RS): given a set of transport requests, which requests should be processed together in the same dual command cycle, and in what order should the cycles be processed? Since storage and retrieval requests may refer to the same physical item, precedence constraints must be observed. Moreover, the crane may not be capable of handling multiple storage or retrieval requests in the same cycle, hence the need to account for incompatibilities. We present a novel exact algorithm based on branch & Benders cut, which is shown to solve even large instances with more than 100 jobs to optimality in many cases. For the special case without precedence constraints and incompatibilities, it improves on several best-known upper bounds from the literature. |
|---|---|
| AbstractList | This paper investigates the problem of scheduling a set of jobs on a single batching machine to minimize the maximum lateness, where jobs may be subject to precedence constraints and incompatibilities. Single batching machine scheduling has many applications, but this study is particularly motivated by single crane scheduling in an automated storage and retrieval system (AS/RS): given a set of transport requests, which requests should be processed together in the same dual command cycle, and in what order should the cycles be processed? Since storage and retrieval requests may refer to the same physical item, precedence constraints must be observed. Moreover, the crane may not be capable of handling multiple storage or retrieval requests in the same cycle, hence the need to account for incompatibilities. We present a novel exact algorithm based on branch & Benders cut, which is shown to solve even large instances with more than 100 jobs to optimality in many cases. For the special case without precedence constraints and incompatibilities, it improves on several best-known upper bounds from the literature. •A generalization of single batching machine scheduling with lateness objective.•A novel logic-based Benders decomposition algorithm.•The algorithm finds new best upper bounds in short time on literature instances.•The algorithm finds high-quality solutions on new instances from the AS/RS context. This paper investigates the problem of scheduling a set of jobs on a single batching machine to minimize the maximum lateness, where jobs may be subject to precedence constraints and incompatibilities. Single batching machine scheduling has many applications, but this study is particularly motivated by single crane scheduling in an automated storage and retrieval system (AS/RS): given a set of transport requests, which requests should be processed together in the same dual command cycle, and in what order should the cycles be processed? Since storage and retrieval requests may refer to the same physical item, precedence constraints must be observed. Moreover, the crane may not be capable of handling multiple storage or retrieval requests in the same cycle, hence the need to account for incompatibilities. We present a novel exact algorithm based on branch & Benders cut, which is shown to solve even large instances with more than 100 jobs to optimality in many cases. For the special case without precedence constraints and incompatibilities, it improves on several best-known upper bounds from the literature. |
| ArticleNumber | 104777 |
| Author | Gendreau, Michel Emde, Simon Polten, Lukas |
| Author_xml | – sequence: 1 givenname: Simon orcidid: 0000-0001-6932-0166 surname: Emde fullname: Emde, Simon email: emde@bwl.tu-darmstadt.de organization: Technische Universität Darmstadt, Fachgebiet Management Science / Operations Research, Hochschulstraße 1, Darmstadt 64289, Germany – sequence: 2 givenname: Lukas surname: Polten fullname: Polten, Lukas email: polten@bwl.tu-darmstadt.de organization: Technische Universität Darmstadt, Fachgebiet Management Science / Operations Research, Hochschulstraße 1, Darmstadt 64289, Germany – sequence: 3 givenname: Michel surname: Gendreau fullname: Gendreau, Michel email: michel.gendreau@cirrelt.net organization: CIRRELT and Département de Mathématiques et de Génie Industriel, École Polytechnique de Montréal, Montreal H3C 3A7, Canada |
| BookMark | eNp9kE1LAzEURYNUsK3-AHcDrqfmYzKTwZUUv6DgRsFdeEnetBnaSU2mgv_eGevKRd_mvsA9CTkzMulCh4RcM7pglJW37cKGuOCU1cO5qKrqjEyZqkRelfJjQqZUUJlTWagLMkuppcNUnE3JchXW3uYGErrMYOcwpsyhDbt9SL73ocuaELNkN-gOW9-tM8gM9HYzrjsYEy_JeQPbhFd_OSfvjw9vy-d89fr0srxf5VYo2eeGIqUKuJNgLEVE3tSykcZZYLVoQKqiLpkUViEgZ4UwKAXImgIoY6UUc3JzvHcfw-cBU6_bcIjd8KTmUila1jVXJ1uCy6oQ9LdVHVs2hpQiNtr6Hsb_9hH8VjOqR6-61YNXPXrVR68Dyf6R--h3EL9PMndHBgc9Xx6jTtZjZ9H5iLbXLvgT9A8eGZHO |
| CitedBy_id | crossref_primary_10_1007_s11750_022_00644_2 crossref_primary_10_1080_01605682_2022_2129488 crossref_primary_10_1016_j_cor_2024_106859 crossref_primary_10_1007_s10479_022_04891_1 crossref_primary_10_1016_j_cor_2024_106933 crossref_primary_10_1016_j_engappai_2024_108572 crossref_primary_10_3390_systems12010003 crossref_primary_10_3390_pr12081772 crossref_primary_10_1016_j_ejor_2024_11_033 crossref_primary_10_1016_j_ejor_2022_01_043 crossref_primary_10_1287_ijoc_2021_1079 crossref_primary_10_1016_j_ejor_2024_10_040 crossref_primary_10_1016_j_omega_2022_102805 crossref_primary_10_1287_ijoc_2021_1074 crossref_primary_10_1080_00207543_2024_2374845 crossref_primary_10_1007_s10479_022_04935_6 crossref_primary_10_1016_j_aei_2025_103543 crossref_primary_10_1016_j_cor_2021_105514 crossref_primary_10_1016_j_aei_2023_102228 crossref_primary_10_1016_j_cor_2021_105639 crossref_primary_10_1016_j_compchemeng_2022_108043 crossref_primary_10_1007_s42524_021_0178_9 crossref_primary_10_1016_j_cor_2021_105231 crossref_primary_10_1287_ijoc_2022_1165 crossref_primary_10_1080_00207543_2021_1951446 crossref_primary_10_1016_j_cor_2021_105258 crossref_primary_10_1016_j_omega_2021_102567 crossref_primary_10_1016_j_omega_2020_102204 crossref_primary_10_1016_j_ejor_2025_05_032 crossref_primary_10_33889_IJMEMS_2021_6_6_088 crossref_primary_10_1016_j_cor_2021_105271 |
| Cites_doi | 10.1023/A:1018959704264 10.1016/j.compchemeng.2006.02.008 10.1080/07408179908969874 10.1080/00207543.2011.633234 10.1287/mnsc.19.5.544 10.1016/j.cie.2018.06.018 10.1002/nav.21768 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R 10.1016/S0167-5060(08)70356-X 10.1016/j.ejor.2016.12.005 10.1080/002075499191094 10.1137/0201010 10.1287/opre.1060.0371 10.1016/j.ejor.2008.01.038 10.1287/opre.1060.0286 10.1080/00207543.2014.965355 10.1080/00207549308956862 10.1016/j.omega.2004.05.003 10.1016/j.cor.2015.04.017 10.1080/00207543.2011.575090 10.1080/07408179508936723 10.1080/00207549508904877 10.1016/j.ejor.2016.04.008 10.1016/S0377-2217(99)00153-8 10.1016/j.cor.2018.07.004 10.1287/opre.40.4.764 10.1007/BF01386316 10.1016/j.omega.2007.11.003 10.1016/j.cie.2017.06.026 10.1080/07408170600559706 |
| ContentType | Journal Article Paper |
| Copyright | 2019 Elsevier Ltd Copyright Pergamon Press Inc. Jan 2020 2019. Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at https://research.stlouisfed.org/research_terms.html . |
| Copyright_xml | – notice: 2019 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jan 2020 – notice: 2019. Notwithstanding the ProQuest Terms and conditions, you may use this content in accordance with the associated terms available at https://research.stlouisfed.org/research_terms.html . |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D 3V. 7WY 7WZ 7XB 87Z 8FK 8FL AAFGM ABLUL ABPUF ABSSA ABUWG ACIOU ADZZV AFKRA AGAJT AGSBL AJNOY AQTIP AZQEC BENPR BEZIV BOUDT CBHQV CCPQU DWQXO FRNLG F~G K60 K6~ L.- M0C PHGZM PHGZT PIMPY PKEHL PQBIZ PQBZA PQCXX PQEST PQQKQ PQUKI PRINS Q9U |
| DOI | 10.1016/j.cor.2019.104777 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni Edition) ProQuest Central Korea - hybrid linking Business Premium Collection - hybrid linking ABI/INFORM Collection (Alumni) - hybrid linking ABI/INFORM Collection - hybrid linking ProQuest Central (Alumni) ABI/INFORM Global - hybrid linking ProQuest Central (Alumni) - hybrid linking ProQuest Central UK/Ireland ProQuest Central Essentials - hybrid linking ABI/INFORM Global (Alumni) - hybrid linking Business Premium Collection (Alumni) - hybrid linking ProQuest Women's & Gender Studies - hybrid linking ProQuest Central Essentials ProQuest Central Business Premium Collection ProQuest One Business - hybrid linking ProQuest One Business (Alumni) - hybrid linking ProQuest One Community College ProQuest Central Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest Business Collection ABI/INFORM Professional Advanced ABI/INFORM Global (OCUL) ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Business (UW System Shared) ProQuest One Business (Alumni) ProQuest Central - hybrid linking ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional Publicly Available Content Database ABI/INFORM Global (Corporate) ProQuest Business Collection (Alumni Edition) ProQuest One Business ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ABI/INFORM Complete ProQuest Central ABI/INFORM Professional Advanced ProQuest Central Korea ProQuest Central (New) ABI/INFORM Complete (Alumni Edition) Business Premium Collection ABI/INFORM Global ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest One Academic Eastern Edition ProQuest Business Collection ProQuest One Academic UKI Edition ProQuest One Business (Alumni) ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X 0305-0548 |
| ExternalDocumentID | 10_1016_j_cor_2019_104777 S0305054819302199 |
| Genre | Working Paper/Pre-Print |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AGCQF JQ2 L7M L~C L~D 3V. 7WY 7XB 8FK 8FL ABUWG AFKRA AZQEC BENPR BEZIV CCPQU DWQXO FRNLG K60 K6~ L.- M0C PHGZM PHGZT PIMPY PKEHL PQBIZ PQBZA PQEST PQUKI PRINS Q9U |
| ID | FETCH-LOGICAL-c385t-b0e008a2d5abc0eee2f95f5bdca193fa58496153c8eae2143be53a590aa8bc553 |
| IEDL.DBID | M0C |
| ISICitedReferencesCount | 37 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000500038300003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Mon Jun 30 17:07:47 EDT 2025 Wed Aug 13 07:58:24 EDT 2025 Sat Nov 29 07:21:07 EST 2025 Tue Nov 18 22:43:31 EST 2025 Fri Feb 23 02:48:34 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Precedence constraints Benders decomposition Single batching machine Automated storage and retrieval Maximum lateness |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c385t-b0e008a2d5abc0eee2f95f5bdca193fa58496153c8eae2143be53a590aa8bc553 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 SourceType-Working Papers-1 ObjectType-Working Paper/Pre-Print-1 content type line 50 |
| ORCID | 0000-0001-6932-0166 |
| OpenAccessLink | https://www.proquest.com/docview/2588069928?pq-origsite=%requestingapplication% |
| PQID | 2588069928 |
| PQPubID | 45870 |
| ParticipantIDs | proquest_journals_2588069928 proquest_journals_2325743028 crossref_citationtrail_10_1016_j_cor_2019_104777 crossref_primary_10_1016_j_cor_2019_104777 elsevier_sciencedirect_doi_10_1016_j_cor_2019_104777 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-01-01 |
| PublicationDateYYYYMMDD | 2020-01-01 |
| PublicationDate_xml | – month: 01 year: 2020 text: 2020-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: St. Louis |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2020 |
| Publisher | Elsevier Ltd Pergamon Press Inc Federal Reserve Bank of St. Louis |
| Publisher_xml | – name: Elsevier Ltd – name: Pergamon Press Inc – name: Federal Reserve Bank of St. Louis |
| References | Roodbergen, Vis (bib0027) 2009; 194 Brucker, Gladky, Hoogeveen, Kovalyov, Potts, Tautenhahn, Van De Velde (bib0004) 1998; 1 Zhu, Wilhelm (bib0033) 2006; 38 Hooker (bib0016) 2007; 55 Chang, Wen, Lin (bib0008) 1995; 27 Pinedo (bib0023) 2016 Hooker (bib0015) 2011; 2 Lawler (bib0018) 1973; 19 Lee, Kim (bib0020) 1995; 33 Van Den Berg (bib0030) 1999; 31 Boysen, Stephan (bib0003) 2016; 254 Emde (bib0012) 2017; 64 Brucker, Hurink (bib0005) 2000; 96 Graham, Lawler, Lenstra, Kan (bib0014) 1979; 5 Potts, Kovalyov (bib0025) 2000; 120 Jia, Jiang, Li (bib0017) 2015; 53 Yugma, Dauzère-Pérès, Artigues, Derreumaux, Sibille (bib0031) 2012; 50 Tarjan (bib0029) 1972; 1 Abedinnia, Glock, Grosse, Schneider (bib0001) 2017; 111 Gagliardi, Renaud, Ruiz (bib0013) 2012; 50 Zhou, Pang, Chen, Chou (bib0032) 2018; 123 Rahmaniani, Crainic, Gendreau, Rei (bib0026) 2017; 259 Cabo, Possani, Potts, Song (bib0007) 2015; 63 Linn, Xie (bib0021) 1993; 31 Possani (bib0024) 2001 Codato, Fischetti (bib0010) 2006; 54 Lee, Uzsoy, Martin-Vega (bib0019) 1992; 40 Méndez, Cerdá, Grossmann, Harjunkoski, Fahl (bib0022) 2006; 30 Chen, Wu (bib0009) 2005; 33 De Koster, Van der Poort, Wolters (bib0011) 1999; 37 Cabo, González-Velarde, Possani, Solís (bib0006) 2018; 100 Benders (bib0002) 1962; 4 Tang, Zhao (bib0028) 2008; 36 Linn (10.1016/j.cor.2019.104777_bib0021) 1993; 31 Pinedo (10.1016/j.cor.2019.104777_bib0023) 2016 Boysen (10.1016/j.cor.2019.104777_bib0003) 2016; 254 Chen (10.1016/j.cor.2019.104777_bib0009) 2005; 33 Codato (10.1016/j.cor.2019.104777_bib0010) 2006; 54 Chang (10.1016/j.cor.2019.104777_bib0008) 1995; 27 Lee (10.1016/j.cor.2019.104777_bib0019) 1992; 40 Lawler (10.1016/j.cor.2019.104777_bib0018) 1973; 19 Graham (10.1016/j.cor.2019.104777_bib0014) 1979; 5 Jia (10.1016/j.cor.2019.104777_bib0017) 2015; 53 Brucker (10.1016/j.cor.2019.104777_bib0004) 1998; 1 Yugma (10.1016/j.cor.2019.104777_bib0031) 2012; 50 Lee (10.1016/j.cor.2019.104777_bib0020) 1995; 33 Brucker (10.1016/j.cor.2019.104777_bib0005) 2000; 96 Van Den Berg (10.1016/j.cor.2019.104777_bib0030) 1999; 31 Cabo (10.1016/j.cor.2019.104777_bib0006) 2018; 100 Emde (10.1016/j.cor.2019.104777_bib0012) 2017; 64 De Koster (10.1016/j.cor.2019.104777_bib0011) 1999; 37 Zhu (10.1016/j.cor.2019.104777_bib0033) 2006; 38 Hooker (10.1016/j.cor.2019.104777_bib0016) 2007; 55 Tang (10.1016/j.cor.2019.104777_bib0028) 2008; 36 Abedinnia (10.1016/j.cor.2019.104777_bib0001) 2017; 111 Roodbergen (10.1016/j.cor.2019.104777_bib0027) 2009; 194 Benders (10.1016/j.cor.2019.104777_bib0002) 1962; 4 Cabo (10.1016/j.cor.2019.104777_bib0007) 2015; 63 Rahmaniani (10.1016/j.cor.2019.104777_bib0026) 2017; 259 Possani (10.1016/j.cor.2019.104777_bib0024) 2001 Gagliardi (10.1016/j.cor.2019.104777_bib0013) 2012; 50 Potts (10.1016/j.cor.2019.104777_bib0025) 2000; 120 Hooker (10.1016/j.cor.2019.104777_bib0015) 2011; 2 Tarjan (10.1016/j.cor.2019.104777_bib0029) 1972; 1 Méndez (10.1016/j.cor.2019.104777_bib0022) 2006; 30 Zhou (10.1016/j.cor.2019.104777_bib0032) 2018; 123 |
| References_xml | – volume: 1 start-page: 31 year: 1998 end-page: 54 ident: bib0004 article-title: Scheduling a batching machine publication-title: J. Scheduling – volume: 38 start-page: 987 year: 2006 end-page: 1007 ident: bib0033 article-title: Scheduling and lot sizing with sequence-dependent setup: a literature review publication-title: IIE Trans. – volume: 4 start-page: 238 year: 1962 end-page: 252 ident: bib0002 article-title: Partitioning procedures for solving mixed-variables programming problems publication-title: Numer. Math. – volume: 96 start-page: 17 year: 2000 end-page: 38 ident: bib0005 article-title: Solving a chemical batch scheduling problem by local search publication-title: Ann. Oper. Res. – volume: 40 start-page: 764 year: 1992 end-page: 775 ident: bib0019 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Oper. Res. – volume: 64 start-page: 476 year: 2017 end-page: 489 ident: bib0012 article-title: Optimally scheduling interfering and non-interfering cranes publication-title: Nav. Res. Logist. – volume: 30 start-page: 913 year: 2006 end-page: 946 ident: bib0022 article-title: State-of-the-art review of optimization methods for short-term scheduling of batch processes publication-title: Comput. Chem. Eng. – volume: 33 start-page: 333 year: 2005 end-page: 343 ident: bib0009 article-title: An association-based clustering approach to order batching considering customer demand patterns publication-title: Omega – volume: 259 start-page: 801 year: 2017 end-page: 817 ident: bib0026 article-title: The benders decomposition algorithm: a literature review publication-title: Eur. J. Oper. Res. – volume: 1 start-page: 146 year: 1972 end-page: 160 ident: bib0029 article-title: Depth-first search and linear graph algorithms publication-title: SIAM J. Comput. – volume: 27 start-page: 108 year: 1995 end-page: 111 ident: bib0008 article-title: The impact of acceleration/deceleration on travel-time models for automated storage/retrieval systems publication-title: IIE Trans. – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: bib0014 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. – year: 2016 ident: bib0023 article-title: Scheduling: Theory, Algorithms, and Systems – volume: 53 start-page: 1866 year: 2015 end-page: 1879 ident: bib0017 article-title: Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing publication-title: Int. J. Prod. Res. – volume: 50 start-page: 2118 year: 2012 end-page: 2132 ident: bib0031 article-title: A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing publication-title: Int. J. Prod. Res. – volume: 63 start-page: 125 year: 2015 end-page: 135 ident: bib0007 article-title: Split–merge: using exponential neighborhood search for scheduling a batching machine publication-title: Comput. Oper. Res. – volume: 37 start-page: 1479 year: 1999 end-page: 1504 ident: bib0011 article-title: Efficient orderbatching methods in warehouses publication-title: Int. J. Prod. Res. – volume: 2 year: 2011 ident: bib0015 article-title: Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction – volume: 120 start-page: 228 year: 2000 end-page: 249 ident: bib0025 article-title: Scheduling with batching: a review publication-title: Eur. J. Oper. Res. – volume: 55 start-page: 588 year: 2007 end-page: 602 ident: bib0016 article-title: Planning and scheduling by logic-based benders decomposition publication-title: Oper. Res. – year: 2001 ident: bib0024 publication-title: Lot Streaming and Batch Scheduling: Splitting and Grouping Jobs to Improve Production Efficiency – volume: 33 start-page: 3331 year: 1995 end-page: 3348 ident: bib0020 article-title: Scheduling of storage/retrieval orders under a just-in-time environment publication-title: Int. J. Prod. Res. – volume: 254 start-page: 691 year: 2016 end-page: 704 ident: bib0003 article-title: A survey on single crane scheduling in automated storage/retrieval systems publication-title: Eur. J. Oper. Res. – volume: 50 start-page: 7110 year: 2012 end-page: 7125 ident: bib0013 article-title: Models for automated storage and retrieval systems: a literature review publication-title: Int. J. Prod. Res. – volume: 54 start-page: 756 year: 2006 end-page: 766 ident: bib0010 article-title: Combinatorial benders’ cuts for mixed-integer linear programming publication-title: Oper. Res. – volume: 194 start-page: 343 year: 2009 end-page: 362 ident: bib0027 article-title: A survey of literature on automated storage and retrieval systems publication-title: Eur. J. Oper. Res. – volume: 111 start-page: 403 year: 2017 end-page: 416 ident: bib0001 article-title: Machine scheduling problems in production: a tertiary study publication-title: Comput. Ind. Eng. – volume: 31 start-page: 2355 year: 1993 end-page: 2367 ident: bib0021 article-title: A simulation analysis of sequencing rules for ASRS in a pull-based assembly facility publication-title: Int. J. Prod. Res. – volume: 19 start-page: 544 year: 1973 end-page: 546 ident: bib0018 article-title: Optimal sequencing of a single machine subject to precedence constraints publication-title: Manage. Sci. – volume: 36 start-page: 992 year: 2008 end-page: 1004 ident: bib0028 article-title: Scheduling a single semi-continuous batching machine publication-title: Omega – volume: 31 start-page: 751 year: 1999 end-page: 762 ident: bib0030 article-title: A literature survey on planning and control of warehousing systems publication-title: IIE Trans. – volume: 100 start-page: 201 year: 2018 end-page: 210 ident: bib0006 article-title: Bi-objective scheduling on a restricted batching machine publication-title: Comput. Oper. Res. – volume: 123 start-page: 67 year: 2018 end-page: 81 ident: bib0032 article-title: A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes publication-title: Comput. Ind. Eng. – volume: 96 start-page: 17 issue: 1–4 year: 2000 ident: 10.1016/j.cor.2019.104777_bib0005 article-title: Solving a chemical batch scheduling problem by local search publication-title: Ann. Oper. Res. doi: 10.1023/A:1018959704264 – volume: 30 start-page: 913 issue: 6–7 year: 2006 ident: 10.1016/j.cor.2019.104777_bib0022 article-title: State-of-the-art review of optimization methods for short-term scheduling of batch processes publication-title: Comput. Chem. Eng. doi: 10.1016/j.compchemeng.2006.02.008 – volume: 31 start-page: 751 issue: 8 year: 1999 ident: 10.1016/j.cor.2019.104777_bib0030 article-title: A literature survey on planning and control of warehousing systems publication-title: IIE Trans. doi: 10.1080/07408179908969874 – volume: 50 start-page: 7110 issue: 24 year: 2012 ident: 10.1016/j.cor.2019.104777_bib0013 article-title: Models for automated storage and retrieval systems: a literature review publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2011.633234 – volume: 19 start-page: 544 year: 1973 ident: 10.1016/j.cor.2019.104777_bib0018 article-title: Optimal sequencing of a single machine subject to precedence constraints publication-title: Manage. Sci. doi: 10.1287/mnsc.19.5.544 – volume: 123 start-page: 67 year: 2018 ident: 10.1016/j.cor.2019.104777_bib0032 article-title: A modified particle swarm optimization algorithm for a batch-processing machine scheduling problem with arbitrary release times and non-identical job sizes publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2018.06.018 – volume: 64 start-page: 476 issue: 6 year: 2017 ident: 10.1016/j.cor.2019.104777_bib0012 article-title: Optimally scheduling interfering and non-interfering cranes publication-title: Nav. Res. Logist. doi: 10.1002/nav.21768 – volume: 1 start-page: 31 issue: 1 year: 1998 ident: 10.1016/j.cor.2019.104777_bib0004 article-title: Scheduling a batching machine publication-title: J. Scheduling doi: 10.1002/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R – year: 2001 ident: 10.1016/j.cor.2019.104777_bib0024 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.cor.2019.104777_bib0014 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 259 start-page: 801 issue: 3 year: 2017 ident: 10.1016/j.cor.2019.104777_bib0026 article-title: The benders decomposition algorithm: a literature review publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.12.005 – volume: 37 start-page: 1479 issue: 7 year: 1999 ident: 10.1016/j.cor.2019.104777_bib0011 article-title: Efficient orderbatching methods in warehouses publication-title: Int. J. Prod. Res. doi: 10.1080/002075499191094 – volume: 1 start-page: 146 issue: 2 year: 1972 ident: 10.1016/j.cor.2019.104777_bib0029 article-title: Depth-first search and linear graph algorithms publication-title: SIAM J. Comput. doi: 10.1137/0201010 – volume: 55 start-page: 588 issue: 3 year: 2007 ident: 10.1016/j.cor.2019.104777_bib0016 article-title: Planning and scheduling by logic-based benders decomposition publication-title: Oper. Res. doi: 10.1287/opre.1060.0371 – volume: 194 start-page: 343 issue: 2 year: 2009 ident: 10.1016/j.cor.2019.104777_bib0027 article-title: A survey of literature on automated storage and retrieval systems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2008.01.038 – volume: 54 start-page: 756 issue: 4 year: 2006 ident: 10.1016/j.cor.2019.104777_bib0010 article-title: Combinatorial benders’ cuts for mixed-integer linear programming publication-title: Oper. Res. doi: 10.1287/opre.1060.0286 – volume: 53 start-page: 1866 issue: 6 year: 2015 ident: 10.1016/j.cor.2019.104777_bib0017 article-title: Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.965355 – volume: 31 start-page: 2355 issue: 10 year: 1993 ident: 10.1016/j.cor.2019.104777_bib0021 article-title: A simulation analysis of sequencing rules for ASRS in a pull-based assembly facility publication-title: Int. J. Prod. Res. doi: 10.1080/00207549308956862 – volume: 33 start-page: 333 issue: 4 year: 2005 ident: 10.1016/j.cor.2019.104777_bib0009 article-title: An association-based clustering approach to order batching considering customer demand patterns publication-title: Omega doi: 10.1016/j.omega.2004.05.003 – volume: 63 start-page: 125 year: 2015 ident: 10.1016/j.cor.2019.104777_bib0007 article-title: Split–merge: using exponential neighborhood search for scheduling a batching machine publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2015.04.017 – volume: 50 start-page: 2118 issue: 8 year: 2012 ident: 10.1016/j.cor.2019.104777_bib0031 article-title: A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2011.575090 – volume: 27 start-page: 108 issue: 1 year: 1995 ident: 10.1016/j.cor.2019.104777_bib0008 article-title: The impact of acceleration/deceleration on travel-time models for automated storage/retrieval systems publication-title: IIE Trans. doi: 10.1080/07408179508936723 – volume: 33 start-page: 3331 issue: 12 year: 1995 ident: 10.1016/j.cor.2019.104777_bib0020 article-title: Scheduling of storage/retrieval orders under a just-in-time environment publication-title: Int. J. Prod. Res. doi: 10.1080/00207549508904877 – volume: 254 start-page: 691 issue: 3 year: 2016 ident: 10.1016/j.cor.2019.104777_bib0003 article-title: A survey on single crane scheduling in automated storage/retrieval systems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2016.04.008 – year: 2016 ident: 10.1016/j.cor.2019.104777_bib0023 – volume: 120 start-page: 228 issue: 2 year: 2000 ident: 10.1016/j.cor.2019.104777_bib0025 article-title: Scheduling with batching: a review publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(99)00153-8 – volume: 100 start-page: 201 year: 2018 ident: 10.1016/j.cor.2019.104777_bib0006 article-title: Bi-objective scheduling on a restricted batching machine publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2018.07.004 – volume: 40 start-page: 764 issue: 4 year: 1992 ident: 10.1016/j.cor.2019.104777_bib0019 article-title: Efficient algorithms for scheduling semiconductor burn-in operations publication-title: Oper. Res. doi: 10.1287/opre.40.4.764 – volume: 4 start-page: 238 issue: 1 year: 1962 ident: 10.1016/j.cor.2019.104777_bib0002 article-title: Partitioning procedures for solving mixed-variables programming problems publication-title: Numer. Math. doi: 10.1007/BF01386316 – volume: 36 start-page: 992 issue: 6 year: 2008 ident: 10.1016/j.cor.2019.104777_bib0028 article-title: Scheduling a single semi-continuous batching machine publication-title: Omega doi: 10.1016/j.omega.2007.11.003 – volume: 111 start-page: 403 year: 2017 ident: 10.1016/j.cor.2019.104777_bib0001 article-title: Machine scheduling problems in production: a tertiary study publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2017.06.026 – volume: 2 year: 2011 ident: 10.1016/j.cor.2019.104777_bib0015 – volume: 38 start-page: 987 issue: 11 year: 2006 ident: 10.1016/j.cor.2019.104777_bib0033 article-title: Scheduling and lot sizing with sequence-dependent setup: a literature review publication-title: IIE Trans. doi: 10.1080/07408170600559706 |
| SSID | ssj0000721 |
| Score | 2.464566 |
| Snippet | •A generalization of single batching machine scheduling with lateness objective.•A novel logic-based Benders decomposition algorithm.•The algorithm finds new... This paper investigates the problem of scheduling a set of jobs on a single batching machine to minimize the maximum lateness, where jobs may be subject to... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 104777 |
| SubjectTerms | Algorithms Automated storage and retrieval Automated storage retrieval systems Benders decomposition Cranes Job shops Lateness Maximum lateness Operations research Precedence constraints Production scheduling Scheduling Single batching machine Upper bounds |
| Title | Logic-based benders decomposition for scheduling a batching machine |
| URI | https://dx.doi.org/10.1016/j.cor.2019.104777 https://www.proquest.com/docview/2325743028 https://www.proquest.com/docview/2588069928 |
| Volume | 113 |
| WOSCitedRecordID | wos000500038300003&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fT8IwEG4EfPBJjRpRJH3wyWRxdCtdn4wQiBghi_EHPDVd1yYaBWTo3-_d2HgwyotPy9I1We7au--uX-8IOXeGQVwRSU_6TkCAkjIvEVjI1U-F0S3XZnn54qc7MRpF47GMi4RbVtAqS5uYG-p0ZjBHfsk4rLS2lCy6mn942DUKT1eLFhoVUkNkg5S-od8tDy9zGhfEcEjgkniYKYT4y_38MMS5d-nv_ve_9kgt1nO72CdbdnpAutg_2Xjon1LayVvFZTS1SB4vGFoUkCqFsBbcDN5Gp5omYJExF0Xfc3KlPSSP_d5D98YreiV4Joj40kt8C95cs5TrxPjWWuYkdzxJQeAycBpwhkRsZyKrLQOQlFgeaC59raPEcB4ckep0NrXHhGoHsAA2vgl9HYagMaaDVssaZ4VjgQ3rxC9FqExRSBz7WbypkjH2qkDqCqWuVlKvk4v1lPmqisamj8NSL6qAASv3rsDKb5rWKBWkin2YKcCLHDASgKjfh9fKO9k8fEp2GAbaee6lQarLxac9I9vma_mSLZqkIp4nTVK7HvTGt_Ds9EbxfTNfi_AWD4bx5BvIKufe |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NS8NAEF2kFfSkomL93INehGC6yZrsQQSrpWItHqp4WzebWVC0rU1V_FP-Rmfy4UG0Nw-eN4El8zLzZvbtDGO7zgrMK2LlKd9FmKCkwksiauTqp5E1TXco8vbFN92o14tvb9XVDPuo7sKQrLLyibmjToeWauQHQiLSDpUS8fHo2aOpUXS6Wo3QKGBxAe9vmLJlR-enaN89Idpn_VbHK6cKeDaI5cRLfMC4Z0QqTWJ9ABBOSSeTFLemAmcwIitiQTYGAwLpRAIyMFL5xsSJlTQlAl1-PQzx9yCpoN-qDktz2RjmjCQYU3R4GkXRb-Hum-PPo1l74b99h0VWvzIjGC-xGRgssxbNh7Yexd-Un-Sj8DKeAonjSwUaRybOMW3HMEq37bnhCUYcqrXxp1w8Civs-k92u8pqg-EA1hg3DmkPOjYb-iYMEZHCBM0mWAeREwGEDeZXJtO2bJRO8zoedaWIe9BoZU1W1oWVG2z_65VR0SVk2sNhhQNd0pyCvmiMYtNe26wAoUs_k2nkwxI5IJLEn5e_wLI-fXmHzXX6l13dPe9dbLB5QUWFvM60yWqT8QtssVn7OrnPxts54jm7-2tofQKdYEE3 |
| 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=Logic-based+benders+decomposition+for+scheduling+a+batching+machine&rft.jtitle=Computers+%26+operations+research&rft.au=Emde%2C+Simon&rft.au=Polten%2C+Lukas&rft.au=Gendreau%2C+Michel&rft.date=2020-01-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=113&rft_id=info:doi/10.1016%2Fj.cor.2019.104777&rft.externalDocID=S0305054819302199 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |