Single machine lot scheduling with optional job-rejection
We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In...
Uložené v:
| Vydané v: | Journal of combinatorial optimization Ročník 41; číslo 1; s. 1 - 11 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer US
01.01.2021
Springer Nature B.V |
| Predmet: | |
| ISSN: | 1382-6905, 1573-2886 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems. |
|---|---|
| AbstractList | We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems. |
| Author | Shapira, Dana Mor, Baruch Mosheiov, Gur |
| Author_xml | – sequence: 1 givenname: Baruch orcidid: 0000-0002-6909-8160 surname: Mor fullname: Mor, Baruch organization: Department of Economics and Business Administration, Ariel University – sequence: 2 givenname: Gur orcidid: 0000-0002-2824-8214 surname: Mosheiov fullname: Mosheiov, Gur email: msomer@huji.ac.il organization: School of Business Administration, The Hebrew University – sequence: 3 givenname: Dana surname: Shapira fullname: Shapira, Dana organization: Department of Computer Science, Ariel University |
| BookMark | eNp9kE1LAzEQhoNUsK3-AU8LnqOTj81mj1LUCgUP6jmkSbbNst3UZIv4701dQfDQ07zDzDMf7wxN-tA7hK4J3BKA6i4RkJXEQAEDiJJgeYampKwYplKKSdZMUixqKC_QLKUWALLmU1S_-n7TuWKnzdb3rujCUCSzdfbQ5ULx6YdtEfaDD73uijascXStM8f8Ep03ukvu6jfO0fvjw9tiiVcvT8-L-xU2jNQDltYyagllzADRjFfMrhura2obqokhApzldSlFZdfCCK5LYypLJCON5iA4m6Obce4-ho-DS4NqwyHmc5KiXAJInl_JXXTsMjGkFF2j9tHvdPxSBNTRIjVapLJF6sciJTMk_0HGD_r43BC1706jbERT3tNvXPy76gT1DRWRfFw |
| CitedBy_id | crossref_primary_10_1007_s12351_023_00744_2 crossref_primary_10_1007_s10479_023_05610_0 crossref_primary_10_1142_S0217595923500409 crossref_primary_10_1007_s10878_021_00709_1 crossref_primary_10_1016_j_orp_2025_100350 crossref_primary_10_1007_s10479_024_06395_6 crossref_primary_10_1007_s11590_023_02086_6 crossref_primary_10_1016_j_cor_2022_105827 crossref_primary_10_1016_j_cor_2024_106617 crossref_primary_10_1016_j_cam_2024_116380 crossref_primary_10_1016_j_cor_2022_105731 crossref_primary_10_1016_j_eswa_2023_120830 crossref_primary_10_1007_s10878_025_01327_x crossref_primary_10_1007_s10878_022_00845_2 crossref_primary_10_1007_s10878_023_01040_7 crossref_primary_10_1142_S021759592450009X crossref_primary_10_1016_j_ejor_2022_03_043 |
| Cites_doi | 10.1007/s40314-020-1130-z 10.1007/s10878-016-0083-z 10.1016/j.tcs.2010.02.006 10.1007/s10951-019-00612-y 10.1080/01605682.2018.1506540 10.1002/nav.21740 10.1007/s10951-012-0303-z 10.1016/j.ipl.2016.02.008 10.1016/j.cor.2018.10.006 10.1080/0305215X.2020.1722119 10.1007/s10479-018-2779-1 10.1007/s11590-019-01389-x 10.1007/s10878-018-0365-8 10.1007/s10878-016-0044-6 10.1016/j.cor.2017.02.010 10.1016/j.ejor.2018.07.038 10.1080/0305215X.2020.1735380 10.1016/j.ipl.2018.10.002 10.1007/s11590-016-1059-8 10.1016/j.ipl.2019.02.008 10.1016/j.omega.2018.04.008 10.1016/j.ipl.2015.11.012 10.1057/s41274-016-0003-8 10.1007/s10878-015-9836-3 10.1080/00207543.2016.1266055 10.1007/s10288-020-00436-z 10.1016/j.ipl.2014.06.016 10.1007/s10878-012-9593-5 10.1007/s10878-016-0016-x 10.1007/s10878-016-9992-0 10.1016/j.ipl.2017.12.004 10.1080/01605682.2019.1621222 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media, LLC, part of Springer Nature 2020 Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| Copyright_xml | – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020 – notice: Springer Science+Business Media, LLC, part of Springer Nature 2020. |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s10878-020-00651-8 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Mathematics |
| EISSN | 1573-2886 |
| EndPage | 11 |
| ExternalDocumentID | 10_1007_s10878_020_00651_8 |
| GroupedDBID | -5D -5G -BR -EM -Y2 -~C .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 29K 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5VS 67Z 6NX 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTD 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 ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN 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 BAPOH BDATZ BGNMA BSONS CAG COF CS3 CSCUP D-I 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 IWAJR IXC IXD IXE IZIGR IZQ I~X I~Z J-C J0Z J9A JBSCW JCJTX JZLTJ KDC KOV LAK LLZTM M4Y MA- N2Q NB0 NPVJJ NQJWS NU0 O9- O93 O9J OAM OVD P2P P9R PF0 PT4 PT5 QOS R89 R9I RNI RNS ROL RPX RSV RZC RZE RZK S16 S1Z S27 S3B SAP SDH SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 TEORI TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 ZMTXR AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA AZQEC BENPR BGLVJ CCPQU CITATION DWQXO GNUQQ HCIFZ M2P M7S PHGZM PHGZT PQGLB PTHSS |
| ID | FETCH-LOGICAL-c319t-8dd32d1233c01a3473dbfda92df2a1c160ed495867db6c64a5cc7d1831fa40643 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 19 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000575732100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1382-6905 |
| IngestDate | Wed Sep 17 23:56:13 EDT 2025 Sat Nov 29 04:54:34 EST 2025 Tue Nov 18 20:48:38 EST 2025 Fri Feb 21 02:48:44 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Lot scheduling Dynamic programming Order rejection Single machine |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c319t-8dd32d1233c01a3473dbfda92df2a1c160ed495867db6c64a5cc7d1831fa40643 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-2824-8214 0000-0002-6909-8160 |
| PQID | 2480084090 |
| PQPubID | 2043856 |
| PageCount | 11 |
| ParticipantIDs | proquest_journals_2480084090 crossref_primary_10_1007_s10878_020_00651_8 crossref_citationtrail_10_1007_s10878_020_00651_8 springer_journals_10_1007_s10878_020_00651_8 |
| PublicationCentury | 2000 |
| PublicationDate | 20210100 2021-01-00 20210101 |
| PublicationDateYYYYMMDD | 2021-01-01 |
| PublicationDate_xml | – month: 1 year: 2021 text: 20210100 |
| PublicationDecade | 2020 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York – name: Dordrecht |
| PublicationTitle | Journal of combinatorial optimization |
| PublicationTitleAbbrev | J Comb Optim |
| PublicationYear | 2021 |
| Publisher | Springer US Springer Nature B.V |
| Publisher_xml | – name: Springer US – name: Springer Nature B.V |
| References | Mosheiov, Pruwer (CR23) 2020 Kong, Liu, Pei, Zhou, Pardalos (CR10) 2019 Mor (CR14) 2018 Agnetis, Mosheiov (CR1) 2017; 11 Mor, Mosheiov (CR21) 2020 Fiszman, Mosheiov (CR5) 2018; 132 Mor, Shapira (CR18) 2019; 70 Mor, Shapira (CR19) 2019 Hou, Yang, Kuo (CR9) 2014; 114 Gerstl, Mosheiov (CR6) 2017; 55 Gerstl, Mor, Mosheiov (CR7) 2017; 83 Ou, Zhong, Li (CR25) 2016; 116 Zhang, Lu, Yuan (CR28) 2010; 411 Mor, Shapira (CR20) 2020; 39 Mor, Mosheiov (CR17) 2018; 271 Zhang, Lu, Li (CR29) 2016; 31 Epstein, Zebedat-Haider (CR4) 2016; 116 Kovalyov, Mosheiov, Sesok (CR11) 2019; 147 Ma, Yuan (CR13) 2017; 34 Lu, Zhang (CR12) 2017; 34 Cordone, Hosteins (CR2) 2019; 102 Hermelin, Pinedo, Shabtay, Talmon (CR8) 2019; 273 Mosheiov, Strusevich (CR24) 2017; 64 Shabtay, Gaspar, Kaspi (CR26) 2013; 16 Mor, Mosheiov (CR16) 2016; 67 Zhong, Pan, Jiang (CR32) 2017; 33 Epstein, Zebedat-Haider (CR3) 2014; 28 Zhang, Xu, Du, Wu (CR30) 2018; 35 Mor (CR15) 2020 Zhang, Liu, Zheng, Xu (CR31) 2019; 142 Mor, Mosheiov, Shapira (CR22) 2019 Wang, Yin, Cheng (CR27) 2018; 81 E Gerstl (651_CR7) 2017; 83 E Epstein (651_CR4) 2016; 116 G Mosheiov (651_CR24) 2017; 64 X Zhong (651_CR32) 2017; 33 MY Kovalyov (651_CR11) 2019; 147 R Ma (651_CR13) 2017; 34 B Mor (651_CR16) 2016; 67 L Zhang (651_CR28) 2010; 411 L Lu (651_CR12) 2017; 34 B Mor (651_CR22) 2019 G Mosheiov (651_CR23) 2020 D Wang (651_CR27) 2018; 81 B Mor (651_CR19) 2019 A Agnetis (651_CR1) 2017; 11 B Mor (651_CR15) 2020 B Mor (651_CR14) 2018 R Cordone (651_CR2) 2019; 102 Y-T Hou (651_CR9) 2014; 114 S Fiszman (651_CR5) 2018; 132 X Zhang (651_CR30) 2018; 35 L Zhang (651_CR29) 2016; 31 J Ou (651_CR25) 2016; 116 B Mor (651_CR18) 2019; 70 B Mor (651_CR21) 2020 D Shabtay (651_CR26) 2013; 16 E Gerstl (651_CR6) 2017; 55 D Hermelin (651_CR8) 2019; 273 E Zhang (651_CR31) 2019; 142 B Mor (651_CR17) 2018; 271 L Epstein (651_CR3) 2014; 28 M Kong (651_CR10) 2019 B Mor (651_CR20) 2020; 39 |
| References_xml | – volume: 39 start-page: 1 year: 2020 end-page: 14 ident: CR20 article-title: Regular scheduling measures on proportionate flowshop with job rejection publication-title: Comput Appl Math doi: 10.1007/s40314-020-1130-z – volume: 34 start-page: 483 year: 2017 end-page: 503 ident: CR13 article-title: Online scheduling to minimize the total weighted completion time plus the rejection cost publication-title: J Combin Optim doi: 10.1007/s10878-016-0083-z – volume: 411 start-page: 1877 year: 2010 end-page: 1882 ident: CR28 article-title: Single-machine scheduling under the job rejection constraint publication-title: Theor Comput Sci doi: 10.1016/j.tcs.2010.02.006 – year: 2019 ident: CR22 article-title: Flowshop scheduling with learning effect and job rejection publication-title: J Sched doi: 10.1007/s10951-019-00612-y – volume: 70 start-page: 1997 year: 2019 end-page: 2003 ident: CR18 article-title: Improved algorithms for scheduling on proportionate flowshop with job-rejection publication-title: J Oper Res Soc doi: 10.1080/01605682.2018.1506540 – volume: 64 start-page: 217 year: 2017 end-page: 224 ident: CR24 article-title: Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow publication-title: Naval Res Logist doi: 10.1002/nav.21740 – volume: 16 start-page: 3 year: 2013 end-page: 28 ident: CR26 article-title: A survey on offline scheduling with rejection publication-title: J Sched doi: 10.1007/s10951-012-0303-z – volume: 116 start-page: 503 year: 2016 end-page: 507 ident: CR25 article-title: Faster algorithms for single machine scheduling with release dates and rejection publication-title: Inf Process Lett doi: 10.1016/j.ipl.2016.02.008 – volume: 102 start-page: 130 year: 2019 end-page: 140 ident: CR2 article-title: A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization publication-title: Comput Oper Res doi: 10.1016/j.cor.2018.10.006 – year: 2020 ident: CR15 article-title: Single-machine lot scheduling with variable lot processing times publication-title: Eng Optim doi: 10.1080/0305215X.2020.1722119 – volume: 271 start-page: 1079 year: 2018 end-page: 1085 ident: CR17 article-title: A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection publication-title: Ann Oper Res doi: 10.1007/s10479-018-2779-1 – year: 2019 ident: CR10 article-title: Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine publication-title: Optim Lett doi: 10.1007/s11590-019-01389-x – year: 2018 ident: CR14 article-title: Minmax scheduling problems with common due-date and completion time penalty publication-title: J Combin Optim doi: 10.1007/s10878-018-0365-8 – volume: 35 start-page: 318 year: 2018 end-page: 330 ident: CR30 article-title: Approximation algorithms for precedence-constrained identical machine scheduling with rejection publication-title: J Combin Optim doi: 10.1007/s10878-016-0044-6 – volume: 83 start-page: 150 year: 2017 end-page: 156 ident: CR7 article-title: Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection publication-title: Comput Oper Res doi: 10.1016/j.cor.2017.02.010 – volume: 273 start-page: 67 year: 2019 end-page: 73 ident: CR8 article-title: On the parameterized tractability of single machine scheduling with rejection publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2018.07.038 – year: 2020 ident: CR23 article-title: On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops publication-title: Eng Optim doi: 10.1080/0305215X.2020.1735380 – volume: 142 start-page: 46 year: 2019 end-page: 51 ident: CR31 article-title: Single machine lot scheduling to minimize the total weighted (discounted) completion time publication-title: Inf Process Lett doi: 10.1016/j.ipl.2018.10.002 – volume: 11 start-page: 885 year: 2017 end-page: 892 ident: CR1 article-title: Scheduling with job-rejection and position-dependent processing times on proportionate flowshops publication-title: Optim Lett doi: 10.1007/s11590-016-1059-8 – volume: 147 start-page: 1 year: 2019 end-page: 2 ident: CR11 article-title: Comments on “Proportionate flowshop with general position dependent processing times” [Inf. Process. Lett. 111 (2011) 174-177] and “Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection” [Inf. Process. Lett. 132 (2018) 39-43] publication-title: Inf Process Lett doi: 10.1016/j.ipl.2019.02.008 – volume: 81 start-page: 246 year: 2018 end-page: 260 ident: CR27 article-title: Parallel-machine rescheduling with job unavailability and rejection publication-title: Omega doi: 10.1016/j.omega.2018.04.008 – volume: 116 start-page: 252 year: 2016 end-page: 255 ident: CR4 article-title: Online scheduling of unit jobs on three machines with rejection: a tight result publication-title: Inf Process Lett doi: 10.1016/j.ipl.2015.11.012 – volume: 67 start-page: 1524 year: 2016 end-page: 1531 ident: CR16 article-title: Minimizing maximum cost on a single machine with two competing agents and job rejection publication-title: J Oper Res Soc doi: 10.1057/s41274-016-0003-8 – volume: 31 start-page: 1493 year: 2016 end-page: 1504 ident: CR29 article-title: New results on two-machine flow-shop scheduling with rejection publication-title: J Combin Optim doi: 10.1007/s10878-015-9836-3 – volume: 55 start-page: 3164 year: 2017 end-page: 3172 ident: CR6 article-title: Single machine scheduling problems with generalised due-dates and job-rejection publication-title: Int J Prod Res doi: 10.1080/00207543.2016.1266055 – year: 2020 ident: CR21 article-title: A note: flowshop scheduling with linear deterioration and job-rejection publication-title: 4OR-Q J Oper Res doi: 10.1007/s10288-020-00436-z – volume: 114 start-page: 718 year: 2014 end-page: 722 ident: CR9 article-title: Lot scheduling on a single machine publication-title: Inf Process Lett doi: 10.1016/j.ipl.2014.06.016 – volume: 28 start-page: 875 year: 2014 end-page: 892 ident: CR3 article-title: Online scheduling with rejection and reordering: exact algorithms for unit size jobs publication-title: J Combin Optim doi: 10.1007/s10878-012-9593-5 – volume: 33 start-page: 934 year: 2017 end-page: 944 ident: CR32 article-title: Scheduling with release times and rejection on two parallel machines publication-title: J Combin Optim doi: 10.1007/s10878-016-0016-x – volume: 34 start-page: 331 year: 2017 end-page: 342 ident: CR12 article-title: Single-machine scheduling with production and rejection costs to minimize the maximum earliness publication-title: J Combin Optim doi: 10.1007/s10878-016-9992-0 – volume: 132 start-page: 39 year: 2018 end-page: 43 ident: CR5 article-title: Minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection publication-title: Inf Process Lett doi: 10.1016/j.ipl.2017.12.004 – year: 2019 ident: CR19 article-title: Scheduling with regular performance measures and optional job rejection on a single machine publication-title: J Oper Res Soc doi: 10.1080/01605682.2019.1621222 – volume: 64 start-page: 217 year: 2017 ident: 651_CR24 publication-title: Naval Res Logist doi: 10.1002/nav.21740 – volume: 16 start-page: 3 year: 2013 ident: 651_CR26 publication-title: J Sched doi: 10.1007/s10951-012-0303-z – volume: 83 start-page: 150 year: 2017 ident: 651_CR7 publication-title: Comput Oper Res doi: 10.1016/j.cor.2017.02.010 – volume: 132 start-page: 39 year: 2018 ident: 651_CR5 publication-title: Inf Process Lett doi: 10.1016/j.ipl.2017.12.004 – volume: 67 start-page: 1524 year: 2016 ident: 651_CR16 publication-title: J Oper Res Soc doi: 10.1057/s41274-016-0003-8 – volume: 114 start-page: 718 year: 2014 ident: 651_CR9 publication-title: Inf Process Lett doi: 10.1016/j.ipl.2014.06.016 – year: 2019 ident: 651_CR10 publication-title: Optim Lett doi: 10.1007/s11590-019-01389-x – volume: 147 start-page: 1 year: 2019 ident: 651_CR11 publication-title: Inf Process Lett doi: 10.1016/j.ipl.2019.02.008 – year: 2020 ident: 651_CR21 publication-title: 4OR-Q J Oper Res doi: 10.1007/s10288-020-00436-z – year: 2020 ident: 651_CR15 publication-title: Eng Optim doi: 10.1080/0305215X.2020.1722119 – year: 2019 ident: 651_CR19 publication-title: J Oper Res Soc doi: 10.1080/01605682.2019.1621222 – volume: 31 start-page: 1493 year: 2016 ident: 651_CR29 publication-title: J Combin Optim doi: 10.1007/s10878-015-9836-3 – volume: 411 start-page: 1877 year: 2010 ident: 651_CR28 publication-title: Theor Comput Sci doi: 10.1016/j.tcs.2010.02.006 – volume: 28 start-page: 875 year: 2014 ident: 651_CR3 publication-title: J Combin Optim doi: 10.1007/s10878-012-9593-5 – volume: 70 start-page: 1997 year: 2019 ident: 651_CR18 publication-title: J Oper Res Soc doi: 10.1080/01605682.2018.1506540 – year: 2019 ident: 651_CR22 publication-title: J Sched doi: 10.1007/s10951-019-00612-y – volume: 142 start-page: 46 year: 2019 ident: 651_CR31 publication-title: Inf Process Lett doi: 10.1016/j.ipl.2018.10.002 – volume: 271 start-page: 1079 year: 2018 ident: 651_CR17 publication-title: Ann Oper Res doi: 10.1007/s10479-018-2779-1 – volume: 116 start-page: 252 year: 2016 ident: 651_CR4 publication-title: Inf Process Lett doi: 10.1016/j.ipl.2015.11.012 – volume: 34 start-page: 331 year: 2017 ident: 651_CR12 publication-title: J Combin Optim doi: 10.1007/s10878-016-9992-0 – volume: 39 start-page: 1 year: 2020 ident: 651_CR20 publication-title: Comput Appl Math doi: 10.1007/s40314-020-1130-z – year: 2020 ident: 651_CR23 publication-title: Eng Optim doi: 10.1080/0305215X.2020.1735380 – volume: 102 start-page: 130 year: 2019 ident: 651_CR2 publication-title: Comput Oper Res doi: 10.1016/j.cor.2018.10.006 – year: 2018 ident: 651_CR14 publication-title: J Combin Optim doi: 10.1007/s10878-018-0365-8 – volume: 116 start-page: 503 year: 2016 ident: 651_CR25 publication-title: Inf Process Lett doi: 10.1016/j.ipl.2016.02.008 – volume: 81 start-page: 246 year: 2018 ident: 651_CR27 publication-title: Omega doi: 10.1016/j.omega.2018.04.008 – volume: 33 start-page: 934 year: 2017 ident: 651_CR32 publication-title: J Combin Optim doi: 10.1007/s10878-016-0016-x – volume: 55 start-page: 3164 year: 2017 ident: 651_CR6 publication-title: Int J Prod Res doi: 10.1080/00207543.2016.1266055 – volume: 34 start-page: 483 year: 2017 ident: 651_CR13 publication-title: J Combin Optim doi: 10.1007/s10878-016-0083-z – volume: 35 start-page: 318 year: 2018 ident: 651_CR30 publication-title: J Combin Optim doi: 10.1007/s10878-016-0044-6 – volume: 273 start-page: 67 year: 2019 ident: 651_CR8 publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2018.07.038 – volume: 11 start-page: 885 year: 2017 ident: 651_CR1 publication-title: Optim Lett doi: 10.1007/s11590-016-1059-8 |
| SSID | ssj0009054 |
| Score | 2.3289974 |
| Snippet | We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1 |
| SubjectTerms | Algorithms Combinatorics Completion time Convex and Discrete Geometry Dynamic programming Job shops Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Rejection Scheduling Theory of Computation Upper bounds |
| Title | Single machine lot scheduling with optional job-rejection |
| URI | https://link.springer.com/article/10.1007/s10878-020-00651-8 https://www.proquest.com/docview/2480084090 |
| Volume | 41 |
| WOSCitedRecordID | wos000575732100001&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: 1573-2886 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0009054 issn: 1382-6905 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/eLvHCXMwnV1NT4NAEJ1o9aAHv43Vajh4UxJYYFmOxth4sTFWTW8EdpbEppamoL_f2QVKNWqiR2DZkNkZ3szuzBuAc8miBLOUghyZSltTnJNJ8cwm8Cb1CDCSKEyziXAwEKNRdF8XhRVNtntzJGn-1EvFbkKzwTJdCc0D1xarsEZwF-pEvofhc0u16wRVK1vyHSn2C-pSme_n-AxHrY_55VjUoE1_-3_fuQNbtXdpXVXqsAsraroHm0ucg3R1tyBqLfYhGtLNibJeTU6lsiZ5aVG8S_ijy9QtvUtr5bNqv9Aa56k9V2OTvDU9gKf-zeP1rV13U7AlmVlpC0SPIQGVJx038fzQwzTDJGKYscSVLncUUrQkeIgpl9xPAilDJIt3s8TXjsshdKb5VB2BFUWovNTjCl30HZqDEC5lHB0Kdx0vCbvgNkKNZU01rjteTOKWJFkLKSYhxUZIsejCxeKdWUW08evoXrNWcW10Rcx8odsDkAJ04bJZm_bxz7Md_234CWwwndliNmJ60Cnnb-oU1uV7-VLMz4wyfgApF9Zh |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60CurBt1itmoM3DSSb1-YoYqnYFqFVeluS3Q1YalKa6O93dpO0VVTQY5LNEGZnMo-d-QbgkpMwEkmMQQ6PuakgzlGl_MRE443i4YmQC6qHTQT9Ph2NwseqKSyvq93rI0n9p15qdqMKDZaoTmjfs026CmsuQQ9fxeiD5wXUruWVo2zRd8TYz6taZb6n8dkcLXzML8ei2tq0d_73nbuwXXmXxk0pDnuwItN92FrCHMSr3hyoNT-AcIA3J9J41TWV0phkhYHxLtof1aZuqCytkU3LfKExzmJzJse6eCs9hKf23fC2Y1bTFEyOalaYVAiHCDRUDrfsyHEDR8SJiEIiEhLZ3PYtKTBaon4gYp_7buRxHgjUeDuJXOW4HEEjzVJ5DEYYCunEji-FLVwLaaCFi4kvLAx3LScKmmDXTGW8ghpXEy8mbAGSrJjEkElMM4nRJlzN35mWQBu_rm7Ve8UqpcsZcakaD4AC0ITrem8Wj3-mdvK35Rew0Rn2uqx73384hU2iqlx0UqYFjWL2Js9gnb8XL_nsXAvmBz8M2UU |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60iujBt1itmoM3Dc1zszmKWhS1FKrSW0h2NmCpSWmjv9_ZPJoqKojHJJshzM5kHjvzDcCpsPwQ44iCHBEJXUGck0qxWCfjTeLhoi-Q58MmvG6XDwZ-b66LP692r44ki54GhdKUZO0xxu25xjeukGEt1RXNXFPni7DkqHI5Fa_3n2vYXcMtxtqSH0lxoFu2zXxP47Npqv3NL0ekueXpbPz_mzdhvfQ6tYtCTLZgQSbbsDaHRUhXDzMA1-kO-H26OZLaa15rKbVRmmkUB5NdUu3rmsreaum4yCNqwzTSJ3KYF3Ulu_DUuX68vNHLKQu6IPXLdI5oW0gGzBaGGdqOZ2MUY-hbGFuhKUxmSKQoijMPIyaYE7pCeEh_AjMOHeXQ7EEjSRO5D5rvo7Qjm0k00TGIBlm-yGJoUBhs2KHXBLNicCBKCHI1CWMU1ODJikkBMSnImRTwJpzN3hkXABy_rm5V-xaUyjgNLIersQEkDE04r_apfvwztYO_LT-Bld5VJ7i_7d4dwqqlil_yXE0LGtnkTR7BsnjPXqaT41xGPwAYh-Ig |
| 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=Single+machine+lot+scheduling+with+optional+job-rejection&rft.jtitle=Journal+of+combinatorial+optimization&rft.au=Mor%2C+Baruch&rft.au=Mosheiov%2C+Gur&rft.au=Shapira%2C+Dana&rft.date=2021-01-01&rft.issn=1382-6905&rft.eissn=1573-2886&rft.volume=41&rft.issue=1&rft.spage=1&rft.epage=11&rft_id=info:doi/10.1007%2Fs10878-020-00651-8&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10878_020_00651_8 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1382-6905&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1382-6905&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1382-6905&client=summon |