Scheduling with time-of-use costs
•Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem. We address a class of problems of scheduling a set of independent jobs onto a single machine that...
Uloženo v:
| Vydáno v: | European journal of operational research Ročník 274; číslo 3; s. 900 - 908 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.05.2019
|
| Témata: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | •Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem.
We address a class of problems of scheduling a set of independent jobs onto a single machine that charges each job for its processing under variable time-of-use tariffs. Our scheduling objective is to minimize the total cost of processing all the jobs subject to a minimum level of performance in one of the regular scheduling criteria. For each of the problems in the class, we establish its computational tractability. For those that are tractable we provide an efficient algorithm, while for those that are intractable we provide a pseudo-polynomial-time algorithm or a polynomial-time approximation scheme. |
|---|---|
| AbstractList | •Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time approximation scheme for an intractable problem.
We address a class of problems of scheduling a set of independent jobs onto a single machine that charges each job for its processing under variable time-of-use tariffs. Our scheduling objective is to minimize the total cost of processing all the jobs subject to a minimum level of performance in one of the regular scheduling criteria. For each of the problems in the class, we establish its computational tractability. For those that are tractable we provide an efficient algorithm, while for those that are intractable we provide a pseudo-polynomial-time algorithm or a polynomial-time approximation scheme. |
| Author | Zhang, Xiandong Chen, Bo |
| Author_xml | – sequence: 1 givenname: Bo orcidid: 0000-0001-7605-9453 surname: Chen fullname: Chen, Bo email: b.chen@warwick.ac.uk, bo.chen@wbs.ac.uk organization: Warwick Business School, University of Warwick, Coventry CV4 7AL, UK – sequence: 2 givenname: Xiandong surname: Zhang fullname: Zhang, Xiandong email: xiandongzhang@fudan.edu.cn organization: School of Management, Fudan University, Shanghai 200433, China |
| BookMark | eNp9z7FOwzAQxnELFYm28AJM5QEcfHYSOxILqqAgVWIAZstxztRRGyPbBfH2pCoTQ6ebfqfvPyOTIQxIyDWwAhjUt32BfYgFZ6AKgIIxfkamoCSntarZhEyZkJJyDvKCzFLqGWNQQTUlN692g91-64ePxbfPm0X2O6TB0X3ChQ0pp0ty7sw24dXfnZP3x4e35RNdv6yel_drakVdZapc59q6NLZ13HSyaQUXrlLAGiNL0QnWSqFUU5W1AyGNFJVAgdxi15QOjRFzoo5_bQwpRXTa-myyD0OOxm81MH1I1b0-pOpDqgbQY-pI-T_6Gf3OxJ_T6O6IcIz68hh1sh6HcZCPaLPugj_FfwGaPG7P |
| CitedBy_id | crossref_primary_10_1016_j_cie_2022_108850 crossref_primary_10_1080_00207543_2019_1624857 crossref_primary_10_1016_j_cor_2022_105788 crossref_primary_10_1080_00207543_2023_2228922 crossref_primary_10_1109_TASE_2024_3468448 crossref_primary_10_1016_j_ejor_2025_06_026 crossref_primary_10_1016_j_ejor_2019_08_017 crossref_primary_10_1016_j_cor_2024_106754 crossref_primary_10_1016_j_cor_2020_105088 crossref_primary_10_1016_j_ejor_2023_05_040 crossref_primary_10_1016_j_cie_2020_106942 crossref_primary_10_1016_j_ejor_2023_01_029 crossref_primary_10_1007_s10479_021_04059_3 crossref_primary_10_1016_j_apenergy_2024_124608 crossref_primary_10_1088_1742_6596_2369_1_012097 crossref_primary_10_1016_j_cor_2025_107100 crossref_primary_10_1016_j_ejor_2025_01_034 crossref_primary_10_1007_s10951_020_00674_3 crossref_primary_10_1016_j_ifacol_2020_12_291 crossref_primary_10_3390_pr10050832 crossref_primary_10_1016_j_cor_2024_106648 crossref_primary_10_1080_00207543_2020_1715504 crossref_primary_10_1016_j_cie_2022_108949 crossref_primary_10_3390_en15197338 crossref_primary_10_1016_j_eneco_2024_107755 crossref_primary_10_1080_00207543_2025_2521047 crossref_primary_10_3390_en14020462 crossref_primary_10_1109_TASE_2020_2995078 crossref_primary_10_1016_j_jclepro_2023_136228 crossref_primary_10_1080_01605682_2020_1796533 |
| Cites_doi | 10.1016/j.tcs.2014.12.020 10.1016/S0377-2217(99)00386-0 10.1016/j.ejor.2014.12.012 10.1016/j.ejor.2008.01.029 10.1016/S0022-0000(03)00006-0 10.1007/s10479-015-2003-5 10.1016/0377-2217(93)90236-G 10.1287/msom.5.3.203.16031 10.1287/mnsc.15.1.102 10.1016/j.ejor.2014.04.031 10.1287/opre.40.5.831 10.1016/S0377-2217(99)00046-6 10.1201/9780203489802 10.1080/07408170802165880 10.24050/reia.v15i30.1276 10.1002/nav.20393 10.1007/978-3-642-38016-7_17 10.1287/trsc.33.2.233 10.1016/j.trb.2015.10.003 10.1016/j.ejor.2004.07.011 10.1016/0167-6377(95)00023-D 10.1016/0377-2217(95)00329-0 |
| ContentType | Journal Article |
| Copyright | 2018 Elsevier B.V. |
| Copyright_xml | – notice: 2018 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2018.11.002 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 908 |
| ExternalDocumentID | 10_1016_j_ejor_2018_11_002 S0377221718309275 |
| 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 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~ 9DU 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 |
| ID | FETCH-LOGICAL-c365t-8fdfb64acbf2ad79b323f58109a743d30b73889546f137a7353e3e2ced94feaa3 |
| ISICitedReferencesCount | 30 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000457509200008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0377-2217 |
| IngestDate | Tue Nov 18 21:51:08 EST 2025 Sat Nov 29 07:22:00 EST 2025 Fri Feb 23 02:49:18 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Scheduling Computational complexity Polynomial-time approximation scheme Time-of-use cost Efficient algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c365t-8fdfb64acbf2ad79b323f58109a743d30b73889546f137a7353e3e2ced94feaa3 |
| ORCID | 0000-0001-7605-9453 |
| PageCount | 9 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2018_11_002 crossref_primary_10_1016_j_ejor_2018_11_002 elsevier_sciencedirect_doi_10_1016_j_ejor_2018_11_002 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-05-01 |
| PublicationDateYYYYMMDD | 2019-05-01 |
| PublicationDate_xml | – month: 05 year: 2019 text: 2019-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2019 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | McGill, van Ryzin (bib0020) 1999; 33 Geng, Yuan (bib0010) 2015; 570 EIA (2018). Energy explained: Your guide to understanding energy. [online]. Weatherford, Bodily (bib0026) 1992; 40 Hoogeveen, de Velde (bib0014) 1995; 17 Allahverdi, Aydilek (bib0001) 2014; 238 Wan, Qi (bib0023) 2010; 57 Chen, Potts, Woeginger (bib0006) 1998; 3 Hoogeveen (bib0013) 2005; 167 Leung, J. Y.-T. (Ed.) (2004). Handbook of scheduling: Algorithms, models, and performance analysis. New York, USA: Chapman & Hall/CRC. Wan, Yen (bib0024) 2009; 195 Fang, Uhan, Zhao, Sutherland (bib0009) 2016; 238 Badinelli (bib0002) 2000; 121 Wang, Meng, Du (bib0025) 2015; 82 Bitran, Caldentey (bib0003) 2003; 5 Kulkarni, Munagala (bib0018) 2013; 7846 accessed on November 15, 2018. Chen, Bulfin (bib0007) 1993; 70 Kellerer, Mansini, Pferschy, Speranza (bib0017) 2003; 66 Huo, Zhao (bib0015) 2015; 243 Chawla, Devanur, Holroyd, Karlin, Martin, Sivan (bib0005) 2017 Gupta, Ruiz-Torres (bib0012) 2000; 125 Kasilingam (bib0016) 1997; 96 Braithwait, Hansen, O’Sheasy (bib0004) 2007 Moore (bib0021) 1968; 15 PG&E (2018). Electric rates: Residential time-of-use. [online]. Gupta, Denton (bib0011) 2008; 40 Fang (10.1016/j.ejor.2018.11.002_bib0009) 2016; 238 Hoogeveen (10.1016/j.ejor.2018.11.002_bib0014) 1995; 17 Chen (10.1016/j.ejor.2018.11.002_sbref0006) 1998; 3 Gupta (10.1016/j.ejor.2018.11.002_bib0011) 2008; 40 Weatherford (10.1016/j.ejor.2018.11.002_bib0026) 1992; 40 Moore (10.1016/j.ejor.2018.11.002_bib0021) 1968; 15 Braithwait (10.1016/j.ejor.2018.11.002_bib0004) 2007 Huo (10.1016/j.ejor.2018.11.002_bib0015) 2015; 243 Chen (10.1016/j.ejor.2018.11.002_bib0007) 1993; 70 McGill (10.1016/j.ejor.2018.11.002_bib0020) 1999; 33 10.1016/j.ejor.2018.11.002_bib0019 Geng (10.1016/j.ejor.2018.11.002_bib0010) 2015; 570 Wan (10.1016/j.ejor.2018.11.002_bib0023) 2010; 57 Hoogeveen (10.1016/j.ejor.2018.11.002_bib0013) 2005; 167 Kulkarni (10.1016/j.ejor.2018.11.002_bib0018) 2013; 7846 Gupta (10.1016/j.ejor.2018.11.002_bib0012) 2000; 125 Wan (10.1016/j.ejor.2018.11.002_bib0024) 2009; 195 Chawla (10.1016/j.ejor.2018.11.002_sbref0005) 2017 Wang (10.1016/j.ejor.2018.11.002_bib0025) 2015; 82 Badinelli (10.1016/j.ejor.2018.11.002_bib0002) 2000; 121 Kasilingam (10.1016/j.ejor.2018.11.002_bib0016) 1997; 96 10.1016/j.ejor.2018.11.002_bib0022 Allahverdi (10.1016/j.ejor.2018.11.002_bib0001) 2014; 238 Bitran (10.1016/j.ejor.2018.11.002_bib0003) 2003; 5 10.1016/j.ejor.2018.11.002_bib0008 Kellerer (10.1016/j.ejor.2018.11.002_bib0017) 2003; 66 |
| References_xml | – volume: 57 start-page: 159 year: 2010 end-page: 171 ident: bib0023 article-title: Scheduling with variable time slot costs publication-title: Naval Research Logistics – volume: 15 start-page: 102 year: 1968 end-page: 109 ident: bib0021 article-title: An publication-title: Management Science – volume: 5 start-page: 203 year: 2003 end-page: 229 ident: bib0003 article-title: An overview of pricing models for revenue management publication-title: Manufacturing & Service Operations Management – volume: 40 start-page: 800 year: 2008 end-page: 819 ident: bib0011 article-title: Appointment scheduling in health care: Challenges and opportunities publication-title: IIE Transactions – volume: 195 start-page: 89 year: 2009 end-page: 97 ident: bib0024 article-title: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs publication-title: European Journal of Operational Research – volume: 167 start-page: 592 year: 2005 end-page: 623 ident: bib0013 article-title: Multicriteria scheduling publication-title: European Journal of Operational Research – year: 2017 ident: bib0005 article-title: Stability of service under time-of-use pricing publication-title: Proceedings of the eighteenth ACM conference on economics and computation – volume: 70 start-page: 115 year: 1993 end-page: 125 ident: bib0007 article-title: Complexity of single machine, multi-criteria scheduling problems publication-title: European Journal of Operational Research – volume: 238 start-page: 199 year: 2016 end-page: 227 ident: bib0009 article-title: Scheduling on a single machine under time-of-use electricity tariffs publication-title: Annals of Operations Research – volume: 96 start-page: 36 year: 1997 end-page: 44 ident: bib0016 article-title: Air cargo revenue management: Characteristics and complexities publication-title: European Journal of Operational Research – volume: 33 start-page: 233 year: 1999 end-page: 256 ident: bib0020 article-title: Revenue management: Research overview and prospects publication-title: Transportation Science – year: 2007 ident: bib0004 article-title: Retail electricity pricing and rate design in evolving markets publication-title: Technical report – reference: , accessed on November 15, 2018. – volume: 125 start-page: 370 year: 2000 end-page: 380 ident: bib0012 article-title: Minimizing makespan subject to minimum total flow-time on identical parallel machines publication-title: European Journal of Operational Research – volume: 40 start-page: 831 year: 1992 end-page: 844 ident: bib0026 article-title: A taxonomy and research overview of perishable-asset revenue management: Yield management, overbooking, and pricing publication-title: Operations Research – volume: 82 start-page: 141 year: 2015 end-page: 161 ident: bib0025 article-title: Liner container seasonal shipping revenue management publication-title: Transportation Research Part B: Methodological – volume: 3 year: 1998 ident: bib0006 article-title: A review of machine scheduling: Complexity, algorithms and approximability publication-title: Handbook of combinatorial optimization – reference: PG&E (2018). Electric rates: Residential time-of-use. [online]. – volume: 570 start-page: 22 year: 2015 end-page: 29 ident: bib0010 article-title: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness publication-title: Theoretical Computer Science – volume: 66 start-page: 349 year: 2003 end-page: 370 ident: bib0017 article-title: An efficient fully polynomial approximation scheme for the subset-sum problem publication-title: Journal of Computer and System Sciences – volume: 243 start-page: 547 year: 2015 end-page: 554 ident: bib0015 article-title: Total completion time minimization on multiple machines subject to machine availability and makespan constraints publication-title: European Journal of Operational Research – reference: Leung, J. Y.-T. (Ed.) (2004). Handbook of scheduling: Algorithms, models, and performance analysis. New York, USA: Chapman & Hall/CRC. – volume: 7846 start-page: 201 year: 2013 end-page: 214 ident: bib0018 article-title: Algorithms for cost-aware scheduling publication-title: Lecture Notes in Computer Science – volume: 17 start-page: 205 year: 1995 end-page: 208 ident: bib0014 article-title: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time publication-title: Operations Research Letters – volume: 238 start-page: 724 year: 2014 end-page: 734 ident: bib0001 article-title: Total completion time with makespan constraint in no-wait flowshops with setup times publication-title: European Journal of Operational Research – volume: 121 start-page: 476 year: 2000 end-page: 503 ident: bib0002 article-title: An optimal, dynamic policy for hotel yield management publication-title: European Journal of Operational Research – reference: EIA (2018). Energy explained: Your guide to understanding energy. [online]. – volume: 570 start-page: 22 year: 2015 ident: 10.1016/j.ejor.2018.11.002_bib0010 article-title: Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2014.12.020 – volume: 125 start-page: 370 issue: 2 year: 2000 ident: 10.1016/j.ejor.2018.11.002_bib0012 article-title: Minimizing makespan subject to minimum total flow-time on identical parallel machines publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00386-0 – volume: 243 start-page: 547 issue: 2 year: 2015 ident: 10.1016/j.ejor.2018.11.002_bib0015 article-title: Total completion time minimization on multiple machines subject to machine availability and makespan constraints publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.12.012 – ident: 10.1016/j.ejor.2018.11.002_bib0022 – volume: 195 start-page: 89 issue: 1 year: 2009 ident: 10.1016/j.ejor.2018.11.002_bib0024 article-title: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.01.029 – volume: 66 start-page: 349 issue: 2 year: 2003 ident: 10.1016/j.ejor.2018.11.002_bib0017 article-title: An efficient fully polynomial approximation scheme for the subset-sum problem publication-title: Journal of Computer and System Sciences doi: 10.1016/S0022-0000(03)00006-0 – volume: 238 start-page: 199 year: 2016 ident: 10.1016/j.ejor.2018.11.002_bib0009 article-title: Scheduling on a single machine under time-of-use electricity tariffs publication-title: Annals of Operations Research doi: 10.1007/s10479-015-2003-5 – volume: 70 start-page: 115 issue: 1 year: 1993 ident: 10.1016/j.ejor.2018.11.002_bib0007 article-title: Complexity of single machine, multi-criteria scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)90236-G – volume: 5 start-page: 203 issue: 3 year: 2003 ident: 10.1016/j.ejor.2018.11.002_bib0003 article-title: An overview of pricing models for revenue management publication-title: Manufacturing & Service Operations Management doi: 10.1287/msom.5.3.203.16031 – volume: 15 start-page: 102 year: 1968 ident: 10.1016/j.ejor.2018.11.002_bib0021 article-title: An n job, one machine sequencing algorithm for minimizing the number of late jobs publication-title: Management Science doi: 10.1287/mnsc.15.1.102 – volume: 238 start-page: 724 issue: 3 year: 2014 ident: 10.1016/j.ejor.2018.11.002_bib0001 article-title: Total completion time with makespan constraint in no-wait flowshops with setup times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2014.04.031 – volume: 40 start-page: 831 issue: 5 year: 1992 ident: 10.1016/j.ejor.2018.11.002_bib0026 article-title: A taxonomy and research overview of perishable-asset revenue management: Yield management, overbooking, and pricing publication-title: Operations Research doi: 10.1287/opre.40.5.831 – volume: 121 start-page: 476 issue: 3 year: 2000 ident: 10.1016/j.ejor.2018.11.002_bib0002 article-title: An optimal, dynamic policy for hotel yield management publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00046-6 – ident: 10.1016/j.ejor.2018.11.002_bib0019 doi: 10.1201/9780203489802 – volume: 40 start-page: 800 year: 2008 ident: 10.1016/j.ejor.2018.11.002_bib0011 article-title: Appointment scheduling in health care: Challenges and opportunities publication-title: IIE Transactions doi: 10.1080/07408170802165880 – ident: 10.1016/j.ejor.2018.11.002_bib0008 doi: 10.24050/reia.v15i30.1276 – volume: 57 start-page: 159 year: 2010 ident: 10.1016/j.ejor.2018.11.002_bib0023 article-title: Scheduling with variable time slot costs publication-title: Naval Research Logistics doi: 10.1002/nav.20393 – year: 2007 ident: 10.1016/j.ejor.2018.11.002_bib0004 article-title: Retail electricity pricing and rate design in evolving markets – volume: 7846 start-page: 201 year: 2013 ident: 10.1016/j.ejor.2018.11.002_bib0018 article-title: Algorithms for cost-aware scheduling publication-title: Lecture Notes in Computer Science doi: 10.1007/978-3-642-38016-7_17 – volume: 33 start-page: 233 issue: 2 year: 1999 ident: 10.1016/j.ejor.2018.11.002_bib0020 article-title: Revenue management: Research overview and prospects publication-title: Transportation Science doi: 10.1287/trsc.33.2.233 – volume: 82 start-page: 141 year: 2015 ident: 10.1016/j.ejor.2018.11.002_bib0025 article-title: Liner container seasonal shipping revenue management publication-title: Transportation Research Part B: Methodological doi: 10.1016/j.trb.2015.10.003 – year: 2017 ident: 10.1016/j.ejor.2018.11.002_sbref0005 article-title: Stability of service under time-of-use pricing – volume: 167 start-page: 592 issue: 3 year: 2005 ident: 10.1016/j.ejor.2018.11.002_bib0013 article-title: Multicriteria scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.011 – volume: 17 start-page: 205 issue: 5 year: 1995 ident: 10.1016/j.ejor.2018.11.002_bib0014 article-title: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time publication-title: Operations Research Letters doi: 10.1016/0167-6377(95)00023-D – volume: 3 year: 1998 ident: 10.1016/j.ejor.2018.11.002_sbref0006 article-title: A review of machine scheduling: Complexity, algorithms and approximability – volume: 96 start-page: 36 issue: 1 year: 1997 ident: 10.1016/j.ejor.2018.11.002_bib0016 article-title: Air cargo revenue management: Characteristics and complexities publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00329-0 |
| SSID | ssj0001515 |
| Score | 2.452889 |
| Snippet | •Detailed picture of computational tractability for the scheduling problems at hand.•Efficient algorithms for tractable problems.•A fully polynomial-time... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 900 |
| SubjectTerms | Computational complexity Efficient algorithm Polynomial-time approximation scheme Scheduling Time-of-use cost |
| Title | Scheduling with time-of-use costs |
| URI | https://dx.doi.org/10.1016/j.ejor.2018.11.002 |
| Volume | 274 |
| WOSCitedRecordID | wos000457509200008&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: ScienceDirect customDbUrl: eissn: 1872-6860 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001515 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEB7aTSnNoY9tQpI-cKG34sWW5JV0TENK20MoJIW9GVkPyJLYYR8lPz8jS_aabghtoRchhGXLM59HM2PNDMDHjOXK5gq_NKF0yhi12OMu5YZVRSW0U8y1xSb42ZmYzeSPWFZx2ZYT4HUtbm_lzX9lNY4hs33o7F-wu78pDmAfmY4tsh3bP2L8ObLBrK82TtbLa5s2Ll23B9OXIXPTvc74qJjiwKJzEcZcQL3P-CQGc3xutjzOMwSaaeJGGP0IPnSpGPoRtgNcQlAV5ykhIbxyYoOMFJykUxHKAHRClIRaOxEtdCASZZYNdlfZZnHYFtzBhzCf2Hnjs7TmYuJzq2Zks031hwfP_aL8mlAaZZLw4jHsYCvFCHaOv53Ovvc7sVfW2r9I8SVi0FQ43_f7k-5XTAbKxsVLeB6thOQ4cPcVPLL1GJ52QQpjeNEV40iibB7D7iCz5Gv4sEFB4lGQDFCQtCjYg59fTi9OvqaxGkaq6bRYpcIZV02Z0pUjynBZUUJdIfJMKtQCDc0qToWQBZu6nHLFaUEttURbI5mzStF9GNVNbQ8gUdQ4paTTWgumiUUTU1tGmDNoLVR5dQh5R4pSx1TxvmLJVdmdCZyXnnylJx_akCWS7xA-9XNuQqKUB68uOgqXUdULKlyJgHhg3tE_znsDzzaYfwuj1WJt38ET_Wt1uVy8j7i5AyM0dnE |
| 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=Scheduling+with+time-of-use+costs&rft.jtitle=European+journal+of+operational+research&rft.au=Chen%2C+Bo&rft.au=Zhang%2C+Xiandong&rft.date=2019-05-01&rft.pub=Elsevier+B.V&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=274&rft.issue=3&rft.spage=900&rft.epage=908&rft_id=info:doi/10.1016%2Fj.ejor.2018.11.002&rft.externalDocID=S0377221718309275 |
| 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 |