Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis
We study single-machine scheduling problems where processing each job requires both processing time and rechargeable energy. Subject to a predefined energy capacity, energy can be recharged after each job during a fixed recharging period. Our focus is on two due date-related scheduling criteria: min...
Saved in:
| Published in: | European journal of operational research Vol. 324; no. 1; pp. 40 - 48 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.07.2025
|
| Subjects: | |
| ISSN: | 0377-2217 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We study single-machine scheduling problems where processing each job requires both processing time and rechargeable energy. Subject to a predefined energy capacity, energy can be recharged after each job during a fixed recharging period. Our focus is on two due date-related scheduling criteria: minimizing the number of late jobs and maximizing the weighted number of jobs completed exactly at their due dates. This study aims to analyze the parameterized tractability of the two problems and develop fixed-parameter algorithms with respect to three natural parameters: the number of different due dates vd, the number of different processing times vp, and the number of different energy consumptions ve. Following the proofs of NP-hardness across several contexts, we demonstrate that both problems remain intractable when parameterized by vd and vp. To complement our results, we show that both problems become fixed-parameter tractable (FPT) when parameterized by ve and vd, and are solvable in polynomial time when both ve and vp are constant.
•Single machine scheduling problems with renewable energy constraints are considered.•Minimizing the number of late jobs is shown to be strongly NP-hard.•Minimizing the weighted number of Just in Time jobs is shown to be strongly NP-hard.•The complexity of both problems is investigated under fixed parameter settings.•Efficient algorithms are developed for parameter combinations with upper bounds. |
|---|---|
| AbstractList | We study single-machine scheduling problems where processing each job requires both processing time and rechargeable energy. Subject to a predefined energy capacity, energy can be recharged after each job during a fixed recharging period. Our focus is on two due date-related scheduling criteria: minimizing the number of late jobs and maximizing the weighted number of jobs completed exactly at their due dates. This study aims to analyze the parameterized tractability of the two problems and develop fixed-parameter algorithms with respect to three natural parameters: the number of different due dates vd, the number of different processing times vp, and the number of different energy consumptions ve. Following the proofs of NP-hardness across several contexts, we demonstrate that both problems remain intractable when parameterized by vd and vp. To complement our results, we show that both problems become fixed-parameter tractable (FPT) when parameterized by ve and vd, and are solvable in polynomial time when both ve and vp are constant.
•Single machine scheduling problems with renewable energy constraints are considered.•Minimizing the number of late jobs is shown to be strongly NP-hard.•Minimizing the weighted number of Just in Time jobs is shown to be strongly NP-hard.•The complexity of both problems is investigated under fixed parameter settings.•Efficient algorithms are developed for parameter combinations with upper bounds. |
| Author | Yu, Renjie Oron, Daniel |
| Author_xml | – sequence: 1 givenname: Renjie surname: Yu fullname: Yu, Renjie – sequence: 2 givenname: Daniel orcidid: 0000-0002-2571-6676 surname: Oron fullname: Oron, Daniel email: daniel.oron@sydney.edu.au |
| BookMark | eNp9kDtu3DAQhlk4QPzIBVLxAlKGkrjcNdwYRl6AARdJaoIiR6sRJHJBchNvbpRbhrJduXA1mMf3A_NdsDMfPDL2UUAtQGw-TTVOIdYNNLIGUQOoM3YOrVJV0wj1nl2kNAGAkEKes38_yO9nrBZjR_LIkx3RHecy5H8oj3ygR3QcPcb9iUe0o4n7dZlpwcRz4At5Wugv8jwi98elx8jDwGeTkU-hT9x492o3HVOuyFdrxtPNNb_lBxPNghljyXLchuUw4yPlU-HNfEqUrti7wcwJP7zUS_bry-efd9-q-4ev3-9u7yvbtV2upMCdwrZB6Np-B5tebjeNctAraQZpwMihg77DYbcZGqW23VaWiXSlhw7crr1k2-dcG0NKEQdtKZtMwedoaNYC9KpZT3rVrFfNGoQumgvavEIPkRYTT29DN88Qlqd-E0adLKG36Kj4ztoFegv_D5JXnuQ |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2025_113531 |
| Cites_doi | 10.1007/s10479-018-2852-9 10.1016/j.ejor.2021.10.058 10.1287/opre.2016.1535 10.1016/0305-0548(95)00078-X 10.1016/S0167-5060(08)70356-X 10.1007/s10951-022-00731-z 10.1016/j.cor.2018.07.020 10.1007/s10951-022-00743-9 10.1080/0951192X.2018.1493229 10.1016/j.ejor.2024.03.021 10.1016/j.ejor.2020.09.042 10.1007/s10951-017-0511-7 10.1287/moor.8.4.538 10.1016/j.cie.2021.107650 10.1016/j.cor.2021.105517 10.1016/j.ejor.2022.11.054 10.1016/j.trd.2023.103697 10.1016/j.trb.2017.02.004 10.1016/j.ejor.2023.08.038 10.1016/j.tre.2023.103335 10.1016/j.ejor.2022.10.023 10.1007/s00224-011-9367-y 10.1007/s10951-019-00617-7 10.1016/j.ejor.2021.11.032 10.1016/j.jclepro.2016.10.057 10.1007/s10107-014-0830-9 10.1007/s10951-023-00788-4 10.1080/03088839.2018.1519862 |
| ContentType | Journal Article |
| Copyright | 2025 |
| Copyright_xml | – notice: 2025 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.ejor.2025.01.007 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EndPage | 48 |
| ExternalDocumentID | 10_1016_j_ejor_2025_01_007 S0377221725000323 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6I. 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AARIN AATTM AAXKI AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEIPS AEKER AENEX AFJKZ AFTJW AFXIZ AGCQF AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APLSM APXCP ARUGR AXJTR BKOJK BKOMP BLXMC BNPGV CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSH SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AAQXK AAYWO AAYXX ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEUPX AFFNX AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKYEP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FEDTE FGOYB HVGLF HZ~ LY1 R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c434t-51e97e32e043b906b58627d0b75af5a0a5f40b4ef96f27784855f45df96040d93 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001464179100001&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:07:20 EST 2025 Sat Nov 29 08:03:45 EST 2025 Sat Apr 26 15:41:48 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | XP FPT W[t] Single machine Parameterized complexity |
| Language | English |
| License | This is an open access article under the CC BY license. |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c434t-51e97e32e043b906b58627d0b75af5a0a5f40b4ef96f27784855f45df96040d93 |
| ORCID | 0000-0002-2571-6676 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.ejor.2025.01.007 |
| PageCount | 9 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2025_01_007 crossref_primary_10_1016_j_ejor_2025_01_007 elsevier_sciencedirect_doi_10_1016_j_ejor_2025_01_007 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-07-01 |
| PublicationDateYYYYMMDD | 2025-07-01 |
| PublicationDate_xml | – month: 07 year: 2025 text: 2025-07-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Mnich, Wiese (b26) 2015; 154 Zhou, Tan (b37) 2018; 31 Gairola, Nezamuddin (b12) 2023; 118 Hermelin, Shabtay, Zelig, Pinedo (b19) 2022; 25 Mosheiov, Oron, Shabtay (b28) 2022; 25 Montoya, Guéret, Mendoza, Villegas (b27) 2017; 103 Dadush, Peikert, Vempala (b5) 2011 Cui, Gao, Yu, Ma, Najafi (b3) 2023; 180 Masone, Murino, Sterle, Strazzullo (b24) 2021 Downey, Fellows (b9) 1992 Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk (b4) 2015 Shabtay, Gerstl (b32) 2024; 316 Tan, Fu (b34) 2024; 313 Yin, Cheng, Wang, Wu (b36) 2017; 20 Transport for NSW (b35) 2024 Downey, Fellows (b10) 2013 Kucukoglu, Dewil, Cattrysse (b20) 2021; 161 Fellows, Gaspers, Rosamond (b11) 2012; 50 Lann, Mosheiov (b21) 1996; 23 Martin, Martin, Lai (b23) 2019; 46 Shabtay, Steiner (b33) 2011 Desaulniers, Errico, Irnich, Schneider (b8) 2016; 64 Raeesi, Sahebjamnia, Mansouri (b31) 2023; 310 Lenstra (b22) 1983; 8 Perumal, Lusby, Larsen (b29) 2022; 301 Hermelin, Shabtay, Talmon (b18) 2019; 22 de Weerdt, Baart, He (b7) 2021; 291 Boccia, Masone, Sterle, Murino (b2) 2023; 307 Graham, Lawler, Lenstra, Kan (b14) 1979; 5 Pottel, Goel (b30) 2022; 301 Hermelin, Mnich, Omlor (b17) 2024 Dang, Singh, Adan, Martagan, van de Sande (b6) 2021; 136 Hermelin, Karhi, Pinedo, Shabtay (b16) 2021; 298 Bechtsis, Tsolakis, Vlachos, Iakovou (b1) 2017; 142 Mnich, Van Bevern (b25) 2018; 100 Garey, Johnson (b13) 1979 Hanen, Munier Kordon (b15) 2024; 27 Shabtay (10.1016/j.ejor.2025.01.007_b33) 2011 Yin (10.1016/j.ejor.2025.01.007_b36) 2017; 20 Garey (10.1016/j.ejor.2025.01.007_b13) 1979 Mosheiov (10.1016/j.ejor.2025.01.007_b28) 2022; 25 Dang (10.1016/j.ejor.2025.01.007_b6) 2021; 136 Downey (10.1016/j.ejor.2025.01.007_b9) 1992 Martin (10.1016/j.ejor.2025.01.007_b23) 2019; 46 Transport for NSW (10.1016/j.ejor.2025.01.007_b35) 2024 Hermelin (10.1016/j.ejor.2025.01.007_b19) 2022; 25 Lann (10.1016/j.ejor.2025.01.007_b21) 1996; 23 Cygan (10.1016/j.ejor.2025.01.007_b4) 2015 Tan (10.1016/j.ejor.2025.01.007_b34) 2024; 313 Hanen (10.1016/j.ejor.2025.01.007_b15) 2024; 27 Graham (10.1016/j.ejor.2025.01.007_b14) 1979; 5 Hermelin (10.1016/j.ejor.2025.01.007_b17) 2024 Shabtay (10.1016/j.ejor.2025.01.007_b32) 2024; 316 Downey (10.1016/j.ejor.2025.01.007_b10) 2013 Dadush (10.1016/j.ejor.2025.01.007_b5) 2011 Desaulniers (10.1016/j.ejor.2025.01.007_b8) 2016; 64 Lenstra (10.1016/j.ejor.2025.01.007_b22) 1983; 8 Montoya (10.1016/j.ejor.2025.01.007_b27) 2017; 103 Hermelin (10.1016/j.ejor.2025.01.007_b16) 2021; 298 de Weerdt (10.1016/j.ejor.2025.01.007_b7) 2021; 291 Zhou (10.1016/j.ejor.2025.01.007_b37) 2018; 31 Hermelin (10.1016/j.ejor.2025.01.007_b18) 2019; 22 Fellows (10.1016/j.ejor.2025.01.007_b11) 2012; 50 Cui (10.1016/j.ejor.2025.01.007_b3) 2023; 180 Mnich (10.1016/j.ejor.2025.01.007_b26) 2015; 154 Pottel (10.1016/j.ejor.2025.01.007_b30) 2022; 301 Raeesi (10.1016/j.ejor.2025.01.007_b31) 2023; 310 Masone (10.1016/j.ejor.2025.01.007_b24) 2021 Mnich (10.1016/j.ejor.2025.01.007_b25) 2018; 100 Bechtsis (10.1016/j.ejor.2025.01.007_b1) 2017; 142 Gairola (10.1016/j.ejor.2025.01.007_b12) 2023; 118 Kucukoglu (10.1016/j.ejor.2025.01.007_b20) 2021; 161 Perumal (10.1016/j.ejor.2025.01.007_b29) 2022; 301 Boccia (10.1016/j.ejor.2025.01.007_b2) 2023; 307 |
| References_xml | – volume: 301 start-page: 445 year: 2022 end-page: 457 ident: b30 article-title: Scheduling activities with time-dependent durations and resource consumptions publication-title: European Journal of Operational Research – volume: 136 year: 2021 ident: b6 article-title: Scheduling heterogeneous multi-load AGVs with battery constraints publication-title: Computers & Operations Research – year: 2015 ident: b4 article-title: Parameterized algorithms – start-page: 15 year: 2021 end-page: 23 ident: b24 article-title: A MILP formulation for an automated guided vehicle scheduling problem with battery constraints publication-title: Advances in production management systems. artificial intelligence for sustainable and resilient production systems – volume: 22 start-page: 663 year: 2019 end-page: 676 ident: b18 article-title: On the parameterized tractability of the just-in-time flow-shop scheduling problem publication-title: Journal of Scheduling – volume: 100 start-page: 254 year: 2018 end-page: 261 ident: b25 article-title: Parameterized complexity of machine scheduling: 15 open problems publication-title: Computers & Operations Research – year: 2013 ident: b10 article-title: Fundamentals of parameterized complexity – volume: 313 start-page: 954 year: 2024 end-page: 976 ident: b34 article-title: Just-in-time scheduling problem with affine idleness cost publication-title: European Journal of Operational Research – volume: 118 year: 2023 ident: b12 article-title: Optimization framework for integrated battery electric bus planning and charging scheduling publication-title: Transportation Research Part D: Transport and Environment – volume: 50 start-page: 675 year: 2012 end-page: 693 ident: b11 article-title: Parameterizing by the number of numbers publication-title: Theory of Computing Systems – volume: 103 start-page: 87 year: 2017 end-page: 110 ident: b27 article-title: The electric vehicle routing problem with nonlinear charging function publication-title: Transportation Research, Part B (Methodological) – volume: 27 start-page: 119 year: 2024 end-page: 133 ident: b15 article-title: Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines publication-title: Journal of Scheduling – volume: 298 start-page: 271 year: 2021 end-page: 287 ident: b16 article-title: New algorithms for minimizing the weighted number of tardy jobs on a single machine publication-title: Annals of Operations Research – volume: 23 start-page: 769 year: 1996 end-page: 781 ident: b21 article-title: Single machine scheduling to minimize the number of early and tardy jobs publication-title: Computers & Operations Research – volume: 20 start-page: 313 year: 2017 end-page: 335 ident: b36 article-title: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs publication-title: Journal of Scheduling – start-page: 1 year: 2024 end-page: 12 ident: b17 article-title: Serial batching to minimize the weighted number of tardy jobs publication-title: Journal of Scheduling – volume: 25 start-page: 577 year: 2022 end-page: 587 ident: b28 article-title: On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates publication-title: Journal of Scheduling – year: 1979 ident: b13 article-title: Computers and intractability: A guide to the theory of NP-completeness – volume: 31 start-page: 978 year: 2018 end-page: 991 ident: b37 article-title: Electric vehicle handling routing and battery swap station location optimisation for automotive assembly lines publication-title: International Journal of Computer Integrated Manufacturing – volume: 46 start-page: 217 year: 2019 end-page: 236 ident: b23 article-title: International container design regulations and ISO standards: are they fit for purpose? publication-title: Maritime Policy & Management – volume: 291 start-page: 629 year: 2021 end-page: 639 ident: b7 article-title: Single-machine scheduling with release times, deadlines, setup times, and rejection publication-title: European Journal of Operational Research – volume: 142 start-page: 3970 year: 2017 end-page: 3984 ident: b1 article-title: Sustainable supply chain management in the digitalization era: The impact of Automated Guided Vehicles publication-title: Journal of Cleaner Production – volume: 25 start-page: 229 year: 2022 end-page: 255 ident: b19 article-title: A general scheme for solving a large set of scheduling problems with rejection in FPT time publication-title: Journal of Scheduling – volume: 154 start-page: 533 year: 2015 end-page: 562 ident: b26 article-title: Scheduling and fixed-parameter tractability publication-title: Mathematical Programming – volume: 316 start-page: 887 year: 2024 end-page: 898 ident: b32 article-title: Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem publication-title: European Journal of Operational Research – year: 2024 ident: b35 article-title: Range and charging - Electric vehicles – volume: 180 year: 2023 ident: b3 article-title: Joint optimal vehicle and recharging scheduling for mixed bus fleets under limited chargers publication-title: Transportation Research Part E: Logistics and Transportation Review – volume: 8 start-page: 538 year: 1983 end-page: 548 ident: b22 article-title: Integer programming with a fixed number of variables publication-title: Mathematics of Operations Research – volume: 307 start-page: 590 year: 2023 end-page: 603 ident: b2 article-title: The parallel AGV scheduling problem with battery constraints: A new formulation and a metaheuristic approach publication-title: European Journal of Operational Research – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: b14 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics – volume: 161 year: 2021 ident: b20 article-title: The electric vehicle routing problem and its variations: A literature review publication-title: Computers & Industrial Engineering – volume: 301 start-page: 395 year: 2022 end-page: 413 ident: b29 article-title: Electric bus planning & scheduling: A review of related problems and methodologies publication-title: European Journal of Operational Research – start-page: 3 year: 2011 end-page: 20 ident: b33 article-title: Scheduling to maximize the number of just-in-time jobs: a survey publication-title: Just-in-time systems – start-page: 580 year: 2011 end-page: 589 ident: b5 article-title: Enumerative lattice algorithms in any norm via m-ellipsoid coverings publication-title: Proceedings of the 52nd annual symposium on foundations of computer science (FOCS 2011) – start-page: 36 year: 1992 end-page: 49 ident: b9 article-title: Fixed-parameter intractability publication-title: Proceedings of the 7th annual structure in complexity theory conference – volume: 64 start-page: 1388 year: 2016 end-page: 1405 ident: b8 article-title: Exact algorithms for electric vehicle-routing problems with time windows publication-title: Operations Research – volume: 310 start-page: 943 year: 2023 end-page: 973 ident: b31 article-title: The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions publication-title: European Journal of Operational Research – volume: 298 start-page: 271 year: 2021 ident: 10.1016/j.ejor.2025.01.007_b16 article-title: New algorithms for minimizing the weighted number of tardy jobs on a single machine publication-title: Annals of Operations Research doi: 10.1007/s10479-018-2852-9 – volume: 301 start-page: 395 issue: 2 year: 2022 ident: 10.1016/j.ejor.2025.01.007_b29 article-title: Electric bus planning & scheduling: A review of related problems and methodologies publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.10.058 – volume: 64 start-page: 1388 issue: 6 year: 2016 ident: 10.1016/j.ejor.2025.01.007_b8 article-title: Exact algorithms for electric vehicle-routing problems with time windows publication-title: Operations Research doi: 10.1287/opre.2016.1535 – volume: 23 start-page: 769 issue: 8 year: 1996 ident: 10.1016/j.ejor.2025.01.007_b21 article-title: Single machine scheduling to minimize the number of early and tardy jobs publication-title: Computers & Operations Research doi: 10.1016/0305-0548(95)00078-X – volume: 5 start-page: 287 year: 1979 ident: 10.1016/j.ejor.2025.01.007_b14 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 25 start-page: 229 issue: 2 year: 2022 ident: 10.1016/j.ejor.2025.01.007_b19 article-title: A general scheme for solving a large set of scheduling problems with rejection in FPT time publication-title: Journal of Scheduling doi: 10.1007/s10951-022-00731-z – volume: 100 start-page: 254 year: 2018 ident: 10.1016/j.ejor.2025.01.007_b25 article-title: Parameterized complexity of machine scheduling: 15 open problems publication-title: Computers & Operations Research doi: 10.1016/j.cor.2018.07.020 – volume: 25 start-page: 577 issue: 5 year: 2022 ident: 10.1016/j.ejor.2025.01.007_b28 article-title: On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates publication-title: Journal of Scheduling doi: 10.1007/s10951-022-00743-9 – volume: 31 start-page: 978 issue: 10 year: 2018 ident: 10.1016/j.ejor.2025.01.007_b37 article-title: Electric vehicle handling routing and battery swap station location optimisation for automotive assembly lines publication-title: International Journal of Computer Integrated Manufacturing doi: 10.1080/0951192X.2018.1493229 – start-page: 580 year: 2011 ident: 10.1016/j.ejor.2025.01.007_b5 article-title: Enumerative lattice algorithms in any norm via m-ellipsoid coverings – volume: 316 start-page: 887 issue: 3 year: 2024 ident: 10.1016/j.ejor.2025.01.007_b32 article-title: Coordinating scheduling and rejection decisions in a two-machine flow shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.03.021 – volume: 291 start-page: 629 issue: 2 year: 2021 ident: 10.1016/j.ejor.2025.01.007_b7 article-title: Single-machine scheduling with release times, deadlines, setup times, and rejection publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2020.09.042 – volume: 20 start-page: 313 year: 2017 ident: 10.1016/j.ejor.2025.01.007_b36 article-title: Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs publication-title: Journal of Scheduling doi: 10.1007/s10951-017-0511-7 – volume: 8 start-page: 538 issue: 4 year: 1983 ident: 10.1016/j.ejor.2025.01.007_b22 article-title: Integer programming with a fixed number of variables publication-title: Mathematics of Operations Research doi: 10.1287/moor.8.4.538 – start-page: 15 year: 2021 ident: 10.1016/j.ejor.2025.01.007_b24 article-title: A MILP formulation for an automated guided vehicle scheduling problem with battery constraints – volume: 161 year: 2021 ident: 10.1016/j.ejor.2025.01.007_b20 article-title: The electric vehicle routing problem and its variations: A literature review publication-title: Computers & Industrial Engineering doi: 10.1016/j.cie.2021.107650 – volume: 136 year: 2021 ident: 10.1016/j.ejor.2025.01.007_b6 article-title: Scheduling heterogeneous multi-load AGVs with battery constraints publication-title: Computers & Operations Research doi: 10.1016/j.cor.2021.105517 – volume: 310 start-page: 943 issue: 3 year: 2023 ident: 10.1016/j.ejor.2025.01.007_b31 article-title: The synergistic effect of operational research and big data analytics in greening container terminal operations: A review and future directions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.11.054 – year: 1979 ident: 10.1016/j.ejor.2025.01.007_b13 – volume: 118 year: 2023 ident: 10.1016/j.ejor.2025.01.007_b12 article-title: Optimization framework for integrated battery electric bus planning and charging scheduling publication-title: Transportation Research Part D: Transport and Environment doi: 10.1016/j.trd.2023.103697 – start-page: 1 year: 2024 ident: 10.1016/j.ejor.2025.01.007_b17 article-title: Serial batching to minimize the weighted number of tardy jobs publication-title: Journal of Scheduling – year: 2013 ident: 10.1016/j.ejor.2025.01.007_b10 – volume: 103 start-page: 87 year: 2017 ident: 10.1016/j.ejor.2025.01.007_b27 article-title: The electric vehicle routing problem with nonlinear charging function publication-title: Transportation Research, Part B (Methodological) doi: 10.1016/j.trb.2017.02.004 – start-page: 36 year: 1992 ident: 10.1016/j.ejor.2025.01.007_b9 article-title: Fixed-parameter intractability – volume: 313 start-page: 954 issue: 3 year: 2024 ident: 10.1016/j.ejor.2025.01.007_b34 article-title: Just-in-time scheduling problem with affine idleness cost publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2023.08.038 – volume: 180 year: 2023 ident: 10.1016/j.ejor.2025.01.007_b3 article-title: Joint optimal vehicle and recharging scheduling for mixed bus fleets under limited chargers publication-title: Transportation Research Part E: Logistics and Transportation Review doi: 10.1016/j.tre.2023.103335 – volume: 307 start-page: 590 issue: 2 year: 2023 ident: 10.1016/j.ejor.2025.01.007_b2 article-title: The parallel AGV scheduling problem with battery constraints: A new formulation and a metaheuristic approach publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.10.023 – volume: 50 start-page: 675 year: 2012 ident: 10.1016/j.ejor.2025.01.007_b11 article-title: Parameterizing by the number of numbers publication-title: Theory of Computing Systems doi: 10.1007/s00224-011-9367-y – year: 2015 ident: 10.1016/j.ejor.2025.01.007_b4 – volume: 22 start-page: 663 year: 2019 ident: 10.1016/j.ejor.2025.01.007_b18 article-title: On the parameterized tractability of the just-in-time flow-shop scheduling problem publication-title: Journal of Scheduling doi: 10.1007/s10951-019-00617-7 – volume: 301 start-page: 445 issue: 2 year: 2022 ident: 10.1016/j.ejor.2025.01.007_b30 article-title: Scheduling activities with time-dependent durations and resource consumptions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.11.032 – start-page: 3 year: 2011 ident: 10.1016/j.ejor.2025.01.007_b33 article-title: Scheduling to maximize the number of just-in-time jobs: a survey – volume: 142 start-page: 3970 year: 2017 ident: 10.1016/j.ejor.2025.01.007_b1 article-title: Sustainable supply chain management in the digitalization era: The impact of Automated Guided Vehicles publication-title: Journal of Cleaner Production doi: 10.1016/j.jclepro.2016.10.057 – year: 2024 ident: 10.1016/j.ejor.2025.01.007_b35 – volume: 154 start-page: 533 issue: 1 year: 2015 ident: 10.1016/j.ejor.2025.01.007_b26 article-title: Scheduling and fixed-parameter tractability publication-title: Mathematical Programming doi: 10.1007/s10107-014-0830-9 – volume: 27 start-page: 119 issue: 2 year: 2024 ident: 10.1016/j.ejor.2025.01.007_b15 article-title: Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines publication-title: Journal of Scheduling doi: 10.1007/s10951-023-00788-4 – volume: 46 start-page: 217 issue: 2 year: 2019 ident: 10.1016/j.ejor.2025.01.007_b23 article-title: International container design regulations and ISO standards: are they fit for purpose? publication-title: Maritime Policy & Management doi: 10.1080/03088839.2018.1519862 |
| SSID | ssj0001515 |
| Score | 2.4859679 |
| Snippet | We study single-machine scheduling problems where processing each job requires both processing time and rechargeable energy. Subject to a predefined energy... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 40 |
| SubjectTerms | FPT Parameterized complexity Single machine W[t] |
| Title | Single-machine scheduling with fixed energy recharging times to minimize the number of late jobs and the number of just-in-time jobs: A parameterized complexity analysis |
| URI | https://dx.doi.org/10.1016/j.ejor.2025.01.007 |
| Volume | 324 |
| WOSCitedRecordID | wos001464179100001&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 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001515 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lj9MwELaqXYTgwKOAWF7ygVtl5Dp23XCr0CLgsCCxSOUUNYktNUqTVZuuKv4Rf4Ffx9jjpA_YFXvgElWJ47Sar57Pk5lvCHmtU6fxISTLuR0xKZVhqY1zpnJXqDmM5IhnvtmEPjsbT6fxl17vV1sLc1nqqhpvNvHFfzU1nANju9LZG5i7mxROwGcwOhzB7HD8J8N_BWdUGrbwWZJmALtX8CZlF3O18w1wTIMlf7DcOaUkXzLlZZuAiTqxkcX8h_GUFBuGOEZZAikdFHW66nIut9eK9aph84q5OfwYrHd3suILl24Ds-WYvG42jvXPghLKla8FAkWGE8s2WBlUibro9fc1oqMq5h02Py8xhwDr5ncDGkJ1ya9dIZfWTAgs6WwX6QgrrffQiEsuqj0F542qnX-4BYxQFG9MUTsNWIFSrdhud1-D-8A3dhmLbTJckbg5EjdHwoeJFzI4FlrFsKIeTz6eTj91PMBRRf8OK_ycULKF2YWH3-TvtGiH6pw_IPfCHoVOEFsPSc9UfXK7LZHok_ttKxAaPEOf3N3RtXxEfu5jkG4xSB0GqccgRQzSLQapxyBtatpikALOKOKM1pY6DFKHLwoYPLi2i0E_5i2d0D0E0i0CaYvAx-Tb-9Pzdx9Y6AnCMhnJhqmhibWJhOEySmM-ShVsyXXOU61mVs34TFnJU2lsPLJC67HTPrJS5daJEPE8jp6Qo6quzFNCtdFmJHJgZ9lYCm7jlA9TmxkXA8hyK07IsDVJkgXBfNe3pUyuBsMJGXT3XKBczLWjVWvpJBBeJLIJAPea-57d6CnPyZ3t3-wFOWqWa_OS3Moum_lq-Sqg9jc4SNSM |
| 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+with+fixed+energy+recharging+times+to+minimize+the+number+of+late+jobs+and+the+number+of+just-in-time+jobs%3A+A+parameterized+complexity+analysis&rft.jtitle=European+journal+of+operational+research&rft.au=Yu%2C+Renjie&rft.au=Oron%2C+Daniel&rft.date=2025-07-01&rft.issn=0377-2217&rft.volume=324&rft.issue=1&rft.spage=40&rft.epage=48&rft_id=info:doi/10.1016%2Fj.ejor.2025.01.007&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2025_01_007 |
| 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 |