Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect
This paper studies systems that can be modeled by single-machine scheduling problems with due date assignment. The actual job processing time is a function of the sum of the processing times of the jobs already processed. The due date assignment methods include the common due date (CON) and the slac...
Saved in:
| Published in: | Applied mathematics and computation Vol. 250; pp. 628 - 635 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.01.2015
|
| Subjects: | |
| ISSN: | 0096-3003, 1873-5649 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper studies systems that can be modeled by single-machine scheduling problems with due date assignment. The actual job processing time is a function of the sum of the processing times of the jobs already processed. The due date assignment methods include the common due date (CON) and the slack due date (SLK). The problem is to determine optimal due date values that minimize objective functions which includes the cost of changing the due dates, a possible penalty for the total earliness of the scheduled jobs and the total penalty for discarding jobs. For the common due date and slack due date, we give polynomial-time dynamic programming algorithms to find the optimal jobs sequence, respectively. |
|---|---|
| AbstractList | This paper studies systems that can be modeled by single-machine scheduling problems with due date assignment. The actual job processing time is a function of the sum of the processing times of the jobs already processed. The due date assignment methods include the common due date (CON) and the slack due date (SLK). The problem is to determine optimal due date values that minimize objective functions which includes the cost of changing the due dates, a possible penalty for the total earliness of the scheduled jobs and the total penalty for discarding jobs. For the common due date and slack due date, we give polynomial-time dynamic programming algorithms to find the optimal jobs sequence, respectively. |
| Author | Xingong, Zhang Yong, Wang |
| Author_xml | – sequence: 1 givenname: Zhang surname: Xingong fullname: Xingong, Zhang organization: School of Mathematics Science, Chongqing Normal University, Chongqing 401331, China – sequence: 2 givenname: Wang surname: Yong fullname: Yong, Wang email: Wangyongcq@126.com organization: College of Economics and Business Administration, Chongqing University, 400030, China |
| BookMark | eNp9kMFu2zAMQIWiA5a2-4DddOzFLlU5coyeimBbiwbtodtZkGm6UWDLnSgv6N9PQXrqoScSJB9BvjNxGqZAQnxXUCpQ5mpXuhHLa1BVqVQJSp2IhVrVuliaqjkVC4DGFBpAfxVnzDsAqI2qFiI--_AyUDE63PpAknFL3Tzkolw_PV49bx5kN5Pc-9BNe-mY_UsYKST5Gqd2oJFzK20lz2Mx9UUuIjFTJ5MfiWXrDvlALobDRup7wnQhvvRuYPr2Hs_Fn58_fq_vis3Tr_v17aZArSEVNSI5oLYCoBodNRoQjIGm170DbFyll6pWbWvapmqrbqUbcth2DvWyN2T0ubg87s1X_Z2Jkx09Iw2DCzTNbJUxzaqq9eo6j6rjKMaJOVJvX6MfXXyzCuzBr93Z7Nce_FqlbPabmfoDgz655KeQovPDp-TNkaT8_T9P0TJ6Ckidj9mP7Sb_Cf0fSZCZVw |
| CitedBy_id | crossref_primary_10_1109_ACCESS_2019_2956551 crossref_primary_10_1016_j_cie_2019_07_032 crossref_primary_10_1016_j_eswa_2020_113348 crossref_primary_10_1016_j_eswa_2021_116180 crossref_primary_10_1080_0305215X_2016_1227616 crossref_primary_10_1016_j_cie_2019_106126 crossref_primary_10_1016_j_eswa_2015_09_050 crossref_primary_10_1080_0305215X_2016_1265305 crossref_primary_10_1155_2021_6687525 crossref_primary_10_1016_j_ejor_2022_03_043 |
| Cites_doi | 10.1142/S0217595915500013 10.1111/j.1540-5915.1991.tb00353.x 10.1016/j.ijpe.2011.02.029 10.1016/j.ijpe.2009.08.012 10.1016/j.ins.2011.11.001 10.1016/j.ins.2012.10.024 10.1016/j.ins.2012.02.043 10.1016/j.ejor.2007.05.040 10.1016/j.ijpe.2010.09.004 10.1080/00207543.2014.886025 10.1007/s11590-011-0382-3 10.1016/j.ins.2012.09.001 10.1016/j.ijpe.2010.12.023 10.1016/j.ejor.2008.07.044 10.1016/j.apm.2013.01.004 10.3934/jimo.2014.10.691 10.1016/j.dam.2005.04.019 10.1016/j.ins.2009.05.002 10.1016/j.amc.2013.03.040 10.1016/j.apm.2013.03.041 10.1016/j.cie.2012.02.015 10.1016/j.ejor.2003.07.023 10.1016/j.ejor.2006.01.030 10.1016/j.amc.2010.02.018 10.1016/0166-218X(93)90088-6 10.1287/opre.51.4.566.16106 |
| ContentType | Journal Article |
| Copyright | 2014 Elsevier Inc. |
| Copyright_xml | – notice: 2014 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 KR7 L7M L~C L~D |
| DOI | 10.1016/j.amc.2014.11.011 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Civil Engineering Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Civil Engineering Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Civil Engineering Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| EndPage | 635 |
| ExternalDocumentID | 10_1016_j_amc_2014_11_011 S0096300314015173 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO ABAOU ABFNM ABFRF ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG RNS ROL RPZ RXW SBC SDF SDG SES SME SPC SPCBC SSW SSZ T5K TN5 WH7 X6Y XPP ZMT ~02 ~G- 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ABXDB ACLOT ACRPL ACVFH ADCNI ADIYS ADMUD ADNMO AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB G-2 HLZ HMJ HVGLF HZ~ R2- SEW TAE VH1 VOH WUQ ~HD 7SC 7TB 8FD FR3 JQ2 KR7 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-7ccea0eb400e7cae930c06609f3fa0c9a435171bb6b94b4d839eacbdac35f6e63 |
| ISICitedReferencesCount | 14 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000346241000054&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0096-3003 |
| IngestDate | Sun Sep 28 07:55:16 EDT 2025 Sat Nov 29 06:12:42 EST 2025 Tue Nov 18 21:37:19 EST 2025 Fri Feb 23 02:31:58 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Single-machine scheduling CON due date assignment Learning effect SLK due date assignment |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-7ccea0eb400e7cae930c06609f3fa0c9a435171bb6b94b4d839eacbdac35f6e63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1669847382 |
| PQPubID | 23500 |
| PageCount | 8 |
| ParticipantIDs | proquest_miscellaneous_1669847382 crossref_primary_10_1016_j_amc_2014_11_011 crossref_citationtrail_10_1016_j_amc_2014_11_011 elsevier_sciencedirect_doi_10_1016_j_amc_2014_11_011 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-01-01 2015-01-00 20150101 |
| PublicationDateYYYYMMDD | 2015-01-01 |
| PublicationDate_xml | – month: 01 year: 2015 text: 2015-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2015 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Shabtay (b0100) 2010; 123 Cheng, Kuo, Yang (b0025) 2013; 221 Gordon, Proth, Strusevich (b0035) 2004 Kahlbacher, Cheng (b0055) 1993; 47 Yin, Cheng, Xu, Wu (b0125) 2012; 63 Zhao, Tang (b0135) 2014; 52 Biskup (b0015) 2008; 188 Gordon, Strusevich (b0040) 2009; 198 Niu, Wan, Wang (b0090) 2015; 32 Wang, Liu, Wang (b0110) 2013; 37 Yang, Hsu, Yang (b0120) 2012; 6 Azaron, Fynes, Modarres (b0010) 2011; 129 Lu, Wang (b0085) 2013; 37 Li, Ng, Yuan (b0070) 2011; 130 De, Ghosh, Wells (b0030) 1991; 22 Agnetis, Hall, Pacciarelli (b0005) 2006; 154 Slotnick, Sobel (b0105) 2005; 169 Rudek (b0115) 2012; 199 Zhang, Yan (b0130) 2010; 216 Li, Ng, Yuan (b0075) 2011; 131 Karp (b0060) 1972 Liu, Yi, Zhou, Gong (b0080) 2013; 219 Hall, Potts (b0045) 2003; 51 Janiak, Janiak, Kovalyov, Kozan, Pesch (b0050) 2013; 224 Zhao, Yin, Cheng, Wu (b0145) 2014; 10 Pinedo (b0095) 2008 Cheng, Lai, Wu, Lee (b0020) 2009; 197 Zhang, Yan, Huang, Tang (b0140) 2012; 187 Kuolamas, Kyparisis (b0065) 2007; 178 Gordon (10.1016/j.amc.2014.11.011_b0035) 2004 Gordon (10.1016/j.amc.2014.11.011_b0040) 2009; 198 Biskup (10.1016/j.amc.2014.11.011_b0015) 2008; 188 Pinedo (10.1016/j.amc.2014.11.011_b0095) 2008 Zhao (10.1016/j.amc.2014.11.011_b0135) 2014; 52 Niu (10.1016/j.amc.2014.11.011_b0090) 2015; 32 Shabtay (10.1016/j.amc.2014.11.011_b0100) 2010; 123 Cheng (10.1016/j.amc.2014.11.011_b0025) 2013; 221 Kahlbacher (10.1016/j.amc.2014.11.011_b0055) 1993; 47 Hall (10.1016/j.amc.2014.11.011_b0045) 2003; 51 Li (10.1016/j.amc.2014.11.011_b0070) 2011; 130 De (10.1016/j.amc.2014.11.011_b0030) 1991; 22 Azaron (10.1016/j.amc.2014.11.011_b0010) 2011; 129 Yang (10.1016/j.amc.2014.11.011_b0120) 2012; 6 Janiak (10.1016/j.amc.2014.11.011_b0050) 2013; 224 Rudek (10.1016/j.amc.2014.11.011_b0115) 2012; 199 Karp (10.1016/j.amc.2014.11.011_b0060) 1972 Agnetis (10.1016/j.amc.2014.11.011_b0005) 2006; 154 Wang (10.1016/j.amc.2014.11.011_b0110) 2013; 37 Zhang (10.1016/j.amc.2014.11.011_b0140) 2012; 187 Kuolamas (10.1016/j.amc.2014.11.011_b0065) 2007; 178 Li (10.1016/j.amc.2014.11.011_b0075) 2011; 131 Liu (10.1016/j.amc.2014.11.011_b0080) 2013; 219 Zhang (10.1016/j.amc.2014.11.011_b0130) 2010; 216 Zhao (10.1016/j.amc.2014.11.011_b0145) 2014; 10 Lu (10.1016/j.amc.2014.11.011_b0085) 2013; 37 Slotnick (10.1016/j.amc.2014.11.011_b0105) 2005; 169 Yin (10.1016/j.amc.2014.11.011_b0125) 2012; 63 Cheng (10.1016/j.amc.2014.11.011_b0020) 2009; 197 |
| References_xml | – volume: 224 start-page: 109 year: 2013 end-page: 117 ident: b0050 article-title: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs publication-title: Inf. Sci. – volume: 63 start-page: 223 year: 2012 end-page: 234 ident: b0125 article-title: Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost publication-title: Comput. Ind. Eng. – start-page: 85 year: 1972 end-page: 103 ident: b0060 article-title: Reducibility among combinatorial problems publication-title: Complexity of Computer Computations – volume: 199 start-page: 216 year: 2012 end-page: 229 ident: b0115 article-title: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model publication-title: Inf. Sci. – volume: 187 start-page: 298 year: 2012 end-page: 304 ident: b0140 article-title: A note on machine scheduling with sum of-logarithm-processing-time-based and position-based learning effects publication-title: Inf. Sci. – volume: 154 start-page: 2044 year: 2006 end-page: 2063 ident: b0005 article-title: Supply chain scheduling: sequence coordination publication-title: Discrete Appl. Math. – volume: 169 start-page: 825 year: 2005 end-page: 856 ident: b0105 article-title: Manufacturing lead-time rules: customer retention versus tardiness cost publication-title: Eur. J. Oper. Res. – volume: 37 start-page: 8394 year: 2013 end-page: 8400 ident: b0110 article-title: Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs publication-title: Appl. Math. Modell. – volume: 188 start-page: 315 year: 2008 end-page: 329 ident: b0015 article-title: A state-of-the-art review on scheduling with learning effect publication-title: Eur. J. Oper. Res. – volume: 198 start-page: 57 year: 2009 end-page: 62 ident: b0040 article-title: Single machine scheduling and due date assignment with positionally dependent processing times publication-title: Eur. J. Oper. Res. – start-page: 21 year: 2004 end-page: 22 ident: b0035 article-title: Scheduling with due date assignment publication-title: Handbook of Scheduling: Algorithms, Models and Performance Analysis – volume: 197 start-page: 3127 year: 2009 end-page: 3135 ident: b0020 article-title: Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations publication-title: Inf. Sci. – volume: 216 start-page: 1259 year: 2010 end-page: 1266 ident: b0130 article-title: Single-machine group scheduling problems with deteriorated and learning effect publication-title: Appl. Math. Comput. – volume: 6 start-page: 1855 year: 2012 end-page: 1873 ident: b0120 article-title: Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance publication-title: Optim. Lett. – volume: 130 start-page: 230 year: 2011 end-page: 235 ident: b0070 article-title: Group scheduling and due date assignment on a single machine publication-title: Int. J. Prod. Econ. – volume: 219 start-page: 8848 year: 2013 end-page: 8855 ident: b0080 article-title: Scheduling two agents with sum-of-processing-times-based deterioration on a single machine publication-title: Appl. Math. Comput. – volume: 32 year: 2015 ident: b0090 article-title: A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect publication-title: Asia–Pac. J. Oper. Res. – year: 2008 ident: b0095 article-title: Planning and Scheduling in Manufacturing and Services – volume: 47 start-page: 139 year: 1993 end-page: 164 ident: b0055 article-title: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs publication-title: Discrete Appl. Math. – volume: 37 start-page: 6695 year: 2013 end-page: 6702 ident: b0085 article-title: Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times publication-title: Appl. Math. Modell. – volume: 123 start-page: 235 year: 2010 end-page: 242 ident: b0100 article-title: Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs publication-title: Int. J. Prod. Econ. – volume: 131 start-page: 747 year: 2011 end-page: 751 ident: b0075 article-title: Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine publication-title: Int. J. Prod. Econ. – volume: 51 start-page: 566 year: 2003 end-page: 584 ident: b0045 article-title: Supply chain scheduling: batching and delivery publication-title: Oper. Res. – volume: 129 start-page: 79 year: 2011 end-page: 85 ident: b0010 article-title: Due date assignment in repetitive projects publication-title: Int. J. Prod. Econ. – volume: 10 start-page: 691 year: 2014 end-page: 700 ident: b0145 article-title: Single-machine scheduling and due-date assignment with rejection and position-dependent processing times publication-title: J. Ind. Manage. Optim. – volume: 22 start-page: 379 year: 1991 end-page: 390 ident: b0030 article-title: Optimal delivery time quotation and order sequencing publication-title: Decis. Sci. – volume: 52 start-page: 2807 year: 2014 end-page: 2814 ident: b0135 article-title: A note on single machine scheduling and due date assignment with general position-dependent processing times publication-title: Int. J. Prod. Res. – volume: 221 start-page: 490 year: 2013 end-page: 500 ident: b0025 article-title: Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position publication-title: Inf. Sci. – volume: 178 start-page: 402 year: 2007 end-page: 407 ident: b0065 article-title: Single-machine and two-machine flowshop scheduling with general learning functions publication-title: Eur. J. Oper. Res. – year: 2008 ident: 10.1016/j.amc.2014.11.011_b0095 – volume: 32 year: 2015 ident: 10.1016/j.amc.2014.11.011_b0090 article-title: A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect publication-title: Asia–Pac. J. Oper. Res. doi: 10.1142/S0217595915500013 – volume: 22 start-page: 379 year: 1991 ident: 10.1016/j.amc.2014.11.011_b0030 article-title: Optimal delivery time quotation and order sequencing publication-title: Decis. Sci. doi: 10.1111/j.1540-5915.1991.tb00353.x – volume: 131 start-page: 747 year: 2011 ident: 10.1016/j.amc.2014.11.011_b0075 article-title: Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2011.02.029 – volume: 123 start-page: 235 year: 2010 ident: 10.1016/j.amc.2014.11.011_b0100 article-title: Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2009.08.012 – volume: 187 start-page: 298 year: 2012 ident: 10.1016/j.amc.2014.11.011_b0140 article-title: A note on machine scheduling with sum of-logarithm-processing-time-based and position-based learning effects publication-title: Inf. Sci. doi: 10.1016/j.ins.2011.11.001 – volume: 224 start-page: 109 year: 2013 ident: 10.1016/j.amc.2014.11.011_b0050 article-title: Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs publication-title: Inf. Sci. doi: 10.1016/j.ins.2012.10.024 – volume: 199 start-page: 216 year: 2012 ident: 10.1016/j.amc.2014.11.011_b0115 article-title: The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model publication-title: Inf. Sci. doi: 10.1016/j.ins.2012.02.043 – volume: 188 start-page: 315 year: 2008 ident: 10.1016/j.amc.2014.11.011_b0015 article-title: A state-of-the-art review on scheduling with learning effect publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2007.05.040 – volume: 129 start-page: 79 year: 2011 ident: 10.1016/j.amc.2014.11.011_b0010 article-title: Due date assignment in repetitive projects publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2010.09.004 – volume: 52 start-page: 2807 year: 2014 ident: 10.1016/j.amc.2014.11.011_b0135 article-title: A note on single machine scheduling and due date assignment with general position-dependent processing times publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.886025 – volume: 6 start-page: 1855 year: 2012 ident: 10.1016/j.amc.2014.11.011_b0120 article-title: Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance publication-title: Optim. Lett. doi: 10.1007/s11590-011-0382-3 – volume: 221 start-page: 490 year: 2013 ident: 10.1016/j.amc.2014.11.011_b0025 article-title: Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position publication-title: Inf. Sci. doi: 10.1016/j.ins.2012.09.001 – volume: 130 start-page: 230 year: 2011 ident: 10.1016/j.amc.2014.11.011_b0070 article-title: Group scheduling and due date assignment on a single machine publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2010.12.023 – volume: 198 start-page: 57 year: 2009 ident: 10.1016/j.amc.2014.11.011_b0040 article-title: Single machine scheduling and due date assignment with positionally dependent processing times publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2008.07.044 – volume: 37 start-page: 6695 year: 2013 ident: 10.1016/j.amc.2014.11.011_b0085 article-title: Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times publication-title: Appl. Math. Modell. doi: 10.1016/j.apm.2013.01.004 – volume: 10 start-page: 691 year: 2014 ident: 10.1016/j.amc.2014.11.011_b0145 article-title: Single-machine scheduling and due-date assignment with rejection and position-dependent processing times publication-title: J. Ind. Manage. Optim. doi: 10.3934/jimo.2014.10.691 – volume: 154 start-page: 2044 year: 2006 ident: 10.1016/j.amc.2014.11.011_b0005 article-title: Supply chain scheduling: sequence coordination publication-title: Discrete Appl. Math. doi: 10.1016/j.dam.2005.04.019 – volume: 197 start-page: 3127 year: 2009 ident: 10.1016/j.amc.2014.11.011_b0020 article-title: Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations publication-title: Inf. Sci. doi: 10.1016/j.ins.2009.05.002 – volume: 219 start-page: 8848 year: 2013 ident: 10.1016/j.amc.2014.11.011_b0080 article-title: Scheduling two agents with sum-of-processing-times-based deterioration on a single machine publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2013.03.040 – volume: 37 start-page: 8394 year: 2013 ident: 10.1016/j.amc.2014.11.011_b0110 article-title: Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs publication-title: Appl. Math. Modell. doi: 10.1016/j.apm.2013.03.041 – volume: 63 start-page: 223 year: 2012 ident: 10.1016/j.amc.2014.11.011_b0125 article-title: Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2012.02.015 – start-page: 85 year: 1972 ident: 10.1016/j.amc.2014.11.011_b0060 article-title: Reducibility among combinatorial problems – volume: 169 start-page: 825 year: 2005 ident: 10.1016/j.amc.2014.11.011_b0105 article-title: Manufacturing lead-time rules: customer retention versus tardiness cost publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2003.07.023 – volume: 178 start-page: 402 year: 2007 ident: 10.1016/j.amc.2014.11.011_b0065 article-title: Single-machine and two-machine flowshop scheduling with general learning functions publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.01.030 – volume: 216 start-page: 1259 year: 2010 ident: 10.1016/j.amc.2014.11.011_b0130 article-title: Single-machine group scheduling problems with deteriorated and learning effect publication-title: Appl. Math. Comput. doi: 10.1016/j.amc.2010.02.018 – start-page: 21 year: 2004 ident: 10.1016/j.amc.2014.11.011_b0035 article-title: Scheduling with due date assignment – volume: 47 start-page: 139 year: 1993 ident: 10.1016/j.amc.2014.11.011_b0055 article-title: Parallel machine scheduling to minimize costs for earliness and number of tardy jobs publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(93)90088-6 – volume: 51 start-page: 566 year: 2003 ident: 10.1016/j.amc.2014.11.011_b0045 article-title: Supply chain scheduling: batching and delivery publication-title: Oper. Res. doi: 10.1287/opre.51.4.566.16106 |
| SSID | ssj0007614 |
| Score | 2.1883953 |
| Snippet | This paper studies systems that can be modeled by single-machine scheduling problems with due date assignment. The actual job processing time is a function of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 628 |
| SubjectTerms | Algorithms Computation CON due date assignment Cost engineering Due dates Learning Learning effect Mathematical analysis Mathematical models Optimization Scheduling Single-machine scheduling SLK due date assignment |
| Title | Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect |
| URI | https://dx.doi.org/10.1016/j.amc.2014.11.011 https://www.proquest.com/docview/1669847382 |
| Volume | 250 |
| WOSCitedRecordID | wos000346241000054&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-5649 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLag4wEeJq5iDJCREA9EHkmc2vHjNHXiUjokOtE3K3GcadOall7Yfj7Ht6YtYhoPvESRlZt8vpzz2eeG0Fue1ByYQE1qUVOSsYqSPKWCJJoVVap4TRNlm03wwSAfjcQ3H5A5t-0EeNPk19di-l9FDWMgbJM6-w_iXj0UBuAchA5HEDscbyX472CMLjUZ2yhJHcHqFayJTTo_OhkYx2n_S1QtdXQFq_HJVQTk-fzMhQT45jLzELc-JpOaTF0mAfBS24Y-MmavCs0mznw8yDrFDbx2vCoIOw_Jc9PlpuN_BE_wIcF247pVQW7wRxjz2xJJd21bwqtaYYLqYrqualNXZNYrS-bTwp3dZa5syR8q3e0uXBwUY1NxMskOTNFVr6A3ymcPTuTxab8vh73R8N30JzGdxYwH3rdZuYt2Ut4VeQftHH7qjT6v7DVnrgJ8-ODg-7ZRgFtv_Rt72bLjlpwMH6Jdv6rAhw4Nj9Ad3TxGD762EniCZpu4wC0uMODiA6ACAyqwQwVuUYEDKrBBBd5GBbaowBYVOKACO1Q8RafHveHRR-IbbhBFabwgXCldxLoEva65KrSgsQJKGsNvXBexEgVw64QnZclKkZVZBeQa7HZZFYp2a6YZfYY6zaTRzxGuyqLOua3GpLNKlUIxrVLOaaVzLUqxh-IwkVL5avSmKcqlDGGHFxLmXpq5h1WqhLnfQ-9Xt0xdKZabLs6CdKTnko4jSsDVTbe9CZKUoGeN86xo9GQ5lwljApgczdMXt7hmH91vf4qXqLOYLfUrdE_9WpzPZ689An8DKAKkXQ |
| linkProvider | Elsevier |
| 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+scheduling+CON%2FSLK+due+window+assignment+problems+with+sum-of-processed+times+based+learning+effect&rft.jtitle=Applied+mathematics+and+computation&rft.au=Xingong%2C+Zhang&rft.au=Yong%2C+Wang&rft.date=2015-01-01&rft.issn=0096-3003&rft.volume=250&rft.spage=628&rft.epage=635&rft_id=info:doi/10.1016%2Fj.amc.2014.11.011&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |