Single-machine scheduling of multiple projects with controllable processing times
•The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total compression cost and total tardiness cost of its jobs.•Two types of problems are considered: Sum problem and Restricted problem. This paper studies...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 308; H. 3; S. 1074 - 1090 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.08.2023
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total compression cost and total tardiness cost of its jobs.•Two types of problems are considered: Sum problem and Restricted problem.
This paper studies the single-machine multiple-project scheduling problem with controllable processing times, in which the cost of a project refers to the total compression cost of its jobs plus the weighted number of tardy jobs in a schedule satisfying some given precedence constraints. It involves four specific problems: (i) minimizing the total cost of an arbitrary number of projects, (ii) being the same as (i) except the jobs from the same project having a common due date, (iii) having a fixed number of projects and minimizing the cost of one project subject to the cost of each of other projects not exceeding a given threshold, and (iv) being the same as (iii) except all jobs having identical weights. We show that a special version of (i) in which each project has only two jobs and all jobs have unit weights and cannot be compressed is strongly NP-hard (it implies the strong NP-hardness of (i)), (ii) is weakly NP-hard and admits a pseudo-polynomial algorithm and a fully polynomial time approximation scheme, (iii) is pseudo-polynomially solvable by a two-phase transformation, and (iv) is weakly NP-hard even if there are only two projects and all jobs have identical maximum compression amounts and identical processing times. |
|---|---|
| AbstractList | •The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total compression cost and total tardiness cost of its jobs.•Two types of problems are considered: Sum problem and Restricted problem.
This paper studies the single-machine multiple-project scheduling problem with controllable processing times, in which the cost of a project refers to the total compression cost of its jobs plus the weighted number of tardy jobs in a schedule satisfying some given precedence constraints. It involves four specific problems: (i) minimizing the total cost of an arbitrary number of projects, (ii) being the same as (i) except the jobs from the same project having a common due date, (iii) having a fixed number of projects and minimizing the cost of one project subject to the cost of each of other projects not exceeding a given threshold, and (iv) being the same as (iii) except all jobs having identical weights. We show that a special version of (i) in which each project has only two jobs and all jobs have unit weights and cannot be compressed is strongly NP-hard (it implies the strong NP-hardness of (i)), (ii) is weakly NP-hard and admits a pseudo-polynomial algorithm and a fully polynomial time approximation scheme, (iii) is pseudo-polynomially solvable by a two-phase transformation, and (iv) is weakly NP-hard even if there are only two projects and all jobs have identical maximum compression amounts and identical processing times. |
| Author | Geng, Zhichao Yuan, Jinjiang |
| Author_xml | – sequence: 1 givenname: Zhichao surname: Geng fullname: Geng, Zhichao email: zcgeng@zzu.edu.cn – sequence: 2 givenname: Jinjiang orcidid: 0000-0002-9814-615X surname: Yuan fullname: Yuan, Jinjiang email: yuanjj@zzu.edu.cn |
| BookMark | eNp9kMtqwzAQRUVJoUnaH-jKP2BXD1tKoJsS-oJAKc1eyONxIyNbQVJa-ve1SVddZDUwwxnuPQsyG_yAhNwyWjDK5F1XYOdDwSkXBWUF5fKCzNlK8VyuJJ2RORVK5ZwzdUUWMXaUUlaxak7eP-zw6TDvDeztgFmEPTZHNy4z32b90SV7cJgdgu8QUsy-bdpn4IcUvHOmPp0AY5yIZHuM1-SyNS7izd9ckt3T427zkm_fnl83D9schKxSrhoKdVnWNUghZGOEEg0VpawqBkBbtqbIZSm4WZu2XSOgMgJAMaN401a1WJLV6S0EH2PAVoNNJtkpmrFOM6onM7rTkxk9mdGU6dHMiPJ_6CHY3oSf89D9CcKx05fFoCNYHAAbG0YzuvH2HP4L1u6BtQ |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2023_08_038 crossref_primary_10_31796_ogummf_1475020 crossref_primary_10_1080_00207543_2025_2525534 crossref_primary_10_1016_j_jmsy_2024_04_026 crossref_primary_10_1016_j_cor_2025_107144 crossref_primary_10_1016_j_ress_2024_110447 crossref_primary_10_1016_j_ress_2024_110129 |
| Cites_doi | 10.1016/0377-2217(80)90111-3 10.1287/opre.1090.0744 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.0.CO;2-J 10.1016/j.ejor.2013.09.017 10.1016/j.tcs.2006.07.011 10.1016/S0167-5060(08)70356-X 10.1016/j.ejor.2022.01.018 10.1016/j.ejor.2013.11.009 10.1287/mnsc.19.4.446 10.1287/opre.1030.0092 10.1016/j.ejor.2015.02.022 10.1287/moor.17.1.36 10.1287/opre.45.2.302 10.1287/opre.9.3.296 10.1007/s10951-018-0598-5 10.1007/s10951-007-0027-7 10.1016/j.dam.2007.02.003 10.1016/j.ejor.2019.07.072 10.1016/j.cor.2008.05.009 10.1016/j.ejor.2010.03.037 10.1016/j.ejor.2021.01.023 10.1016/S0167-6377(96)00035-1 10.1007/s10898-018-0686-2 10.1023/A:1022231419049 10.1007/s10951-020-00658-3 10.1016/j.ejor.2021.03.034 10.1007/s10951-016-0479-8 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier B.V. |
| Copyright_xml | – notice: 2023 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2023.01.026 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 1090 |
| ExternalDocumentID | 10_1016_j_ejor_2023_01_026 S0377221723000449 |
| 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 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 ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW 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 EJD FEDTE FGOYB HVGLF HZ~ R2- VH1 WUQ ~HD |
| ID | FETCH-LOGICAL-c365t-7d0cb44bbc6336da373d0346551cc0f190e26432a9aff9ece7a3cc71a72df5b3 |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000954554000001&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 | Sat Nov 29 07:24:36 EST 2025 Tue Nov 18 22:28:25 EST 2025 Fri Feb 23 02:38:06 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Pseudo-polynomial algorithm Scheduling Controllable processing times Multiple projects Compression cost |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c365t-7d0cb44bbc6336da373d0346551cc0f190e26432a9aff9ece7a3cc71a72df5b3 |
| ORCID | 0000-0002-9814-615X |
| PageCount | 17 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2023_01_026 crossref_primary_10_1016_j_ejor_2023_01_026 elsevier_sciencedirect_doi_10_1016_j_ejor_2023_01_026 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-08-01 |
| PublicationDateYYYYMMDD | 2023-08-01 |
| PublicationDate_xml | – month: 08 year: 2023 text: 2023-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2023 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Chen, Yuan, Gao (bib0006) 2019; 22 Shabtay, Steiner (bib0025) 2007; 155 Graham, Lawler, Lenstra, Rinnooy Kan (bib0016) 1979; 4 De, Dunne, Ghosh, Wells (bib0013) 1997; 45 Shioura, Shakhlevich, Strusevich (bib0026) 2020; 76 Garey, Johnson (bib0015) 1979 Falk, Horowitz (bib0014) 1972; 19 Artigues, Demassey, Neron (bib0004) 2008 Kelley (bib0020) 1961; 9 Lenstra, Rinnooy Kan (bib0021) 1980; 4 Cheng, Ng, Yuan (bib0009) 2006; 362 Hassin (bib0017) 1992; 517 Baker, Smith (bib0005) 2003; 6 Agnetis, Billaut, Gawiejnowicz, Pacciarelli, Soukhal (bib0001) 2014 Yuan, Ng, Cheng (bib0031) 2019; 280 Choi, Park (bib0012) 2020; 23 Tseng, Lia, Huang (bib0027) 2009; 36 Šøucha, Agnetis, Šidlovský, Briand (bib0028) 2021; 294 Ahuja, Magnanti, Orlin (bib0003) 1993 Choi, Chung (bib0010) 2014; 236 Agnetis, Mirchandani, Pacciarelli, Pacifici (bib0002) 2004; 52 Cheng, Chen, Li, Lin (bib0008) 1998; 45 He, Zhang, Yuce (bib0018) 2022 Shabtay (bib0024) 2022; 296 Yuan (bib0030) 2017; 20 Perez-Gonzalez, Framinan (bib0023) 2014; 235 Choi, Park (bib0011) 2015; 244 Leung, Pinedo, Wan (bib0022) 2010; 58 Cheng, Chen, Li (bib0007) 1996; 19 Weglarz, Jozefowska, Mika, Waligora (bib0029) 2011; 208 He, Wei, Cheng (bib0019) 2007; 10 Ahuja (10.1016/j.ejor.2023.01.026_bib0003) 1993 Artigues (10.1016/j.ejor.2023.01.026_bib0004) 2008 He (10.1016/j.ejor.2023.01.026_bib0018) 2022 Shabtay (10.1016/j.ejor.2023.01.026_bib0025) 2007; 155 Šøucha (10.1016/j.ejor.2023.01.026_bib0028) 2021; 294 Hassin (10.1016/j.ejor.2023.01.026_bib0017) 1992; 517 Agnetis (10.1016/j.ejor.2023.01.026_bib0002) 2004; 52 Shabtay (10.1016/j.ejor.2023.01.026_bib0024) 2022; 296 Tseng (10.1016/j.ejor.2023.01.026_bib0027) 2009; 36 Falk (10.1016/j.ejor.2023.01.026_bib0014) 1972; 19 Garey (10.1016/j.ejor.2023.01.026_bib0015) 1979 Cheng (10.1016/j.ejor.2023.01.026_bib0008) 1998; 45 Weglarz (10.1016/j.ejor.2023.01.026_bib0029) 2011; 208 Choi (10.1016/j.ejor.2023.01.026_bib0012) 2020; 23 Shioura (10.1016/j.ejor.2023.01.026_bib0026) 2020; 76 Baker (10.1016/j.ejor.2023.01.026_bib0005) 2003; 6 Graham (10.1016/j.ejor.2023.01.026_bib0016) 1979; 4 Kelley (10.1016/j.ejor.2023.01.026_bib0020) 1961; 9 He (10.1016/j.ejor.2023.01.026_bib0019) 2007; 10 Yuan (10.1016/j.ejor.2023.01.026_bib0030) 2017; 20 Lenstra (10.1016/j.ejor.2023.01.026_bib0021) 1980; 4 Choi (10.1016/j.ejor.2023.01.026_bib0010) 2014; 236 Agnetis (10.1016/j.ejor.2023.01.026_bib0001) 2014 Chen (10.1016/j.ejor.2023.01.026_bib0006) 2019; 22 Cheng (10.1016/j.ejor.2023.01.026_bib0009) 2006; 362 Cheng (10.1016/j.ejor.2023.01.026_bib0007) 1996; 19 Choi (10.1016/j.ejor.2023.01.026_bib0011) 2015; 244 De (10.1016/j.ejor.2023.01.026_bib0013) 1997; 45 Leung (10.1016/j.ejor.2023.01.026_bib0022) 2010; 58 Perez-Gonzalez (10.1016/j.ejor.2023.01.026_bib0023) 2014; 235 Yuan (10.1016/j.ejor.2023.01.026_bib0031) 2019; 280 |
| References_xml | – volume: 22 start-page: 581 year: 2019 end-page: 593 ident: bib0006 article-title: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs publication-title: Journal of Scheduling – volume: 294 start-page: 29 year: 2021 end-page: 41 ident: bib0028 article-title: Nash equilibrium solutions in multi-agent project scheduling with milestones publication-title: European Journal of Operational Research – year: 1993 ident: bib0003 article-title: Network flows: Theory, algorithms and applications – volume: 10 start-page: 303 year: 2007 end-page: 310 ident: bib0019 article-title: Single-machine scheduling with trade-off between number of tardy jobs and compression cost publication-title: Journal of Scheduling – volume: 4 start-page: 270 year: 1980 end-page: 275 ident: bib0021 article-title: Complexity results for scheduling chains on a single machine publication-title: European Journal of Operational Research – volume: 58 start-page: 458 year: 2010 end-page: 469 ident: bib0022 article-title: Competitive two agent scheduling and its applications publication-title: Operations Research – volume: 45 start-page: 302 year: 1997 end-page: 306 ident: bib0013 article-title: Complexity of the discrete time-cost trade-off problem for project networks publication-title: Operations Research – volume: 76 start-page: 471 year: 2020 end-page: 490 ident: bib0026 article-title: Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost publication-title: Journal of Global Optimization – volume: 19 start-page: 446 year: 1972 end-page: 455 ident: bib0014 article-title: Critical path problems with concave cost-time curves publication-title: Management Science – volume: 517 start-page: 36 year: 1992 end-page: 42 ident: bib0017 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research – volume: 9 start-page: 296 year: 1961 end-page: 320 ident: bib0020 article-title: Critical path planning and scheduling: Mathematical basis publication-title: Operations Research – volume: 362 start-page: 273 year: 2006 end-page: 281 ident: bib0009 article-title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoretical Computer Science – year: 1979 ident: bib0015 article-title: Computers and intractability: A guide to the theory of NP-completeness – volume: 208 start-page: 177 year: 2011 end-page: 205 ident: bib0029 article-title: Project scheduling with finite or infinite number of activity processing modes - a survey publication-title: European Journal of Operational Research – volume: 244 start-page: 748 year: 2015 end-page: 752 ident: bib0011 article-title: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs publication-title: European Journal of Operational Research – volume: 296 start-page: 423 year: 2022 end-page: 439 ident: bib0024 article-title: Single-machine scheduling with machine unavailability periods and resource dependent processing times publication-title: European Journal of Operational Research – volume: 45 start-page: 67 year: 1998 end-page: 82 ident: bib0008 article-title: Scheduling to minimize the total compression and late costs publication-title: Naval Research Logistics – volume: 36 start-page: 1643 year: 2009 end-page: 1666 ident: bib0027 article-title: Minimizing total tardiness on a single machine with controllable processing times publication-title: Computers and Operations Research – year: 2008 ident: bib0004 article-title: Resource-constrained project scheduling – volume: 19 start-page: 237 year: 1996 end-page: 242 ident: bib0007 article-title: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation publication-title: Operations Research Letters – volume: 23 start-page: 619 year: 2020 end-page: 628 ident: bib0012 article-title: Scheduling two projects with controllable processing times in a single-machine environment publication-title: Journal of Scheduling – volume: 6 start-page: 7 year: 2003 end-page: 16 ident: bib0005 article-title: A multiple-criterion model for machine scheduling publication-title: Journal of Scheduling – volume: 52 start-page: 229 year: 2004 end-page: 242 ident: bib0002 article-title: Scheduling problems with two competing agents publication-title: Operations Research – year: 2014 ident: bib0001 article-title: Multi-agent scheduling: Models and algorithms – volume: 236 start-page: 61 year: 2014 end-page: 68 ident: bib0010 article-title: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs publication-title: European Journal of Operational Research – volume: 4 start-page: 287 year: 1979 end-page: 326 ident: bib0016 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Annals of Discrete Mathematics – volume: 155 start-page: 1643 year: 2007 end-page: 1666 ident: bib0025 article-title: A survey of scheduling with controllable processing times publication-title: Discrete Applied Mathematics – volume: 280 start-page: 860 year: 2019 end-page: 875 ident: bib0031 article-title: Scheduling with release dates and preemption to minimize multiple max-form objective functions publication-title: European Journal of Operational Research – volume: 20 start-page: 211 year: 2017 end-page: 218 ident: bib0030 article-title: Unary NP-hardness of minimizing the number of tardy jobs with deadlines publication-title: Journal of Scheduling – year: 2022 ident: bib0018 article-title: Integrated multi-project planning and scheduling - a multi-agent approach publication-title: European Journal of Operational Research – volume: 235 start-page: 1 year: 2014 end-page: 16 ident: bib0023 article-title: A common framework and taxonomy for multi-criteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems publication-title: European Journal of Operational Research – volume: 4 start-page: 270 year: 1980 ident: 10.1016/j.ejor.2023.01.026_bib0021 article-title: Complexity results for scheduling chains on a single machine publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(80)90111-3 – volume: 58 start-page: 458 year: 2010 ident: 10.1016/j.ejor.2023.01.026_bib0022 article-title: Competitive two agent scheduling and its applications publication-title: Operations Research doi: 10.1287/opre.1090.0744 – volume: 45 start-page: 67 year: 1998 ident: 10.1016/j.ejor.2023.01.026_bib0008 article-title: Scheduling to minimize the total compression and late costs publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.0.CO;2-J – volume: 235 start-page: 1 year: 2014 ident: 10.1016/j.ejor.2023.01.026_bib0023 article-title: A common framework and taxonomy for multi-criteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.09.017 – volume: 362 start-page: 273 year: 2006 ident: 10.1016/j.ejor.2023.01.026_bib0009 article-title: Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2006.07.011 – volume: 4 start-page: 287 year: 1979 ident: 10.1016/j.ejor.2023.01.026_bib0016 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 – year: 1993 ident: 10.1016/j.ejor.2023.01.026_bib0003 – year: 2022 ident: 10.1016/j.ejor.2023.01.026_bib0018 article-title: Integrated multi-project planning and scheduling - a multi-agent approach publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2022.01.018 – volume: 236 start-page: 61 year: 2014 ident: 10.1016/j.ejor.2023.01.026_bib0010 article-title: Complexity results for the linear time-cost tradeoff problem with multiple milestones and completely ordered jobs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2013.11.009 – volume: 19 start-page: 446 year: 1972 ident: 10.1016/j.ejor.2023.01.026_bib0014 article-title: Critical path problems with concave cost-time curves publication-title: Management Science doi: 10.1287/mnsc.19.4.446 – volume: 52 start-page: 229 year: 2004 ident: 10.1016/j.ejor.2023.01.026_bib0002 article-title: Scheduling problems with two competing agents publication-title: Operations Research doi: 10.1287/opre.1030.0092 – volume: 244 start-page: 748 year: 2015 ident: 10.1016/j.ejor.2023.01.026_bib0011 article-title: A continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2015.02.022 – volume: 517 start-page: 36 year: 1992 ident: 10.1016/j.ejor.2023.01.026_bib0017 article-title: Approximation schemes for the restricted shortest path problem publication-title: Mathematics of Operations Research doi: 10.1287/moor.17.1.36 – volume: 45 start-page: 302 year: 1997 ident: 10.1016/j.ejor.2023.01.026_bib0013 article-title: Complexity of the discrete time-cost trade-off problem for project networks publication-title: Operations Research doi: 10.1287/opre.45.2.302 – volume: 9 start-page: 296 year: 1961 ident: 10.1016/j.ejor.2023.01.026_bib0020 article-title: Critical path planning and scheduling: Mathematical basis publication-title: Operations Research doi: 10.1287/opre.9.3.296 – volume: 22 start-page: 581 year: 2019 ident: 10.1016/j.ejor.2023.01.026_bib0006 article-title: The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs publication-title: Journal of Scheduling doi: 10.1007/s10951-018-0598-5 – volume: 10 start-page: 303 year: 2007 ident: 10.1016/j.ejor.2023.01.026_bib0019 article-title: Single-machine scheduling with trade-off between number of tardy jobs and compression cost publication-title: Journal of Scheduling doi: 10.1007/s10951-007-0027-7 – volume: 155 start-page: 1643 year: 2007 ident: 10.1016/j.ejor.2023.01.026_bib0025 article-title: A survey of scheduling with controllable processing times publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2007.02.003 – volume: 280 start-page: 860 year: 2019 ident: 10.1016/j.ejor.2023.01.026_bib0031 article-title: Scheduling with release dates and preemption to minimize multiple max-form objective functions publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.07.072 – volume: 36 start-page: 1643 year: 2009 ident: 10.1016/j.ejor.2023.01.026_bib0027 article-title: Minimizing total tardiness on a single machine with controllable processing times publication-title: Computers and Operations Research doi: 10.1016/j.cor.2008.05.009 – volume: 208 start-page: 177 year: 2011 ident: 10.1016/j.ejor.2023.01.026_bib0029 article-title: Project scheduling with finite or infinite number of activity processing modes - a survey publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2010.03.037 – volume: 294 start-page: 29 year: 2021 ident: 10.1016/j.ejor.2023.01.026_bib0028 article-title: Nash equilibrium solutions in multi-agent project scheduling with milestones publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.01.023 – year: 2014 ident: 10.1016/j.ejor.2023.01.026_bib0001 – year: 1979 ident: 10.1016/j.ejor.2023.01.026_bib0015 – volume: 19 start-page: 237 year: 1996 ident: 10.1016/j.ejor.2023.01.026_bib0007 article-title: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation publication-title: Operations Research Letters doi: 10.1016/S0167-6377(96)00035-1 – year: 2008 ident: 10.1016/j.ejor.2023.01.026_bib0004 – volume: 76 start-page: 471 year: 2020 ident: 10.1016/j.ejor.2023.01.026_bib0026 article-title: Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost publication-title: Journal of Global Optimization doi: 10.1007/s10898-018-0686-2 – volume: 6 start-page: 7 year: 2003 ident: 10.1016/j.ejor.2023.01.026_bib0005 article-title: A multiple-criterion model for machine scheduling publication-title: Journal of Scheduling doi: 10.1023/A:1022231419049 – volume: 23 start-page: 619 year: 2020 ident: 10.1016/j.ejor.2023.01.026_bib0012 article-title: Scheduling two projects with controllable processing times in a single-machine environment publication-title: Journal of Scheduling doi: 10.1007/s10951-020-00658-3 – volume: 296 start-page: 423 year: 2022 ident: 10.1016/j.ejor.2023.01.026_bib0024 article-title: Single-machine scheduling with machine unavailability periods and resource dependent processing times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.03.034 – volume: 20 start-page: 211 year: 2017 ident: 10.1016/j.ejor.2023.01.026_bib0030 article-title: Unary NP-hardness of minimizing the number of tardy jobs with deadlines publication-title: Journal of Scheduling doi: 10.1007/s10951-016-0479-8 |
| SSID | ssj0001515 |
| Score | 2.458373 |
| Snippet | •The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 1074 |
| SubjectTerms | Compression cost Controllable processing times Multiple projects Pseudo-polynomial algorithm Scheduling |
| Title | Single-machine scheduling of multiple projects with controllable processing times |
| URI | https://dx.doi.org/10.1016/j.ejor.2023.01.026 |
| Volume | 308 |
| WOSCitedRecordID | wos000954554000001&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: 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/eLvHCXMwtV1Lb9NAEB6VFiE48AiglgLaQ2-V0XrXznqPFWqhPVSqyCHqxbJ319AoOFGSVv35zHofMVWo6KEXy1rFE8fzZWZ2_M0MwEGu0ccqLpPUGLtB0TSRWvOkrrQoEFT1kLlhE-L8vBiPZXiju-zGCYi2LW5v5fxRVY1rqGxbOvsAdUehuIDnqHQ8otrx-F-K_4HOaGqS3x1L0hzi7hW9ydSTmyN_0GdglpF7bgnr066Oau5qB7o6qlggsil57wNZXFiElKLvHRRzzN-MsyWXvyw9fxZtzLXLu55dtRPE589-7oHxyHyLNVdCJIy56stgTzktesDhPetoyZ89T2s5oRutuEsoTL6Yycy2bGXcdVbd0DL7jiuLBMPAXZuUVkZpZZQ0LVHGE9hhIpdoAHeOTo_HZ9Ft28iue-Xkf5KvsHJkwLt3sjmK6UUmo9fw0m8pyJGDwhvYMu0AnoWKhgG8CpM7iDfkA3jRa0P5Fi7-hgxZQ4bMGhIgQwJkiIUM6UOGrCFDOsi8g9HJ8ejr98SP2kgUH-arRGiq6iyrazXkfKgrLrim3PbWS5WiDUaNBiNnzipZNY00yoiKKyXSSjDd5DV_D9vtrDW7QGhWN7TQUmbMZOg70cDLHO0AlVyizGIP0vDkSuXb0NtpKNPy3zrbg8N4zdw1Ybn303lQSOnDSBceloive6778KBv2Yfn63_ER9heLa7NJ3iqblZXy8VnD64_0g6XDA |
| 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+of+multiple+projects+with+controllable+processing+times&rft.jtitle=European+journal+of+operational+research&rft.au=Geng%2C+Zhichao&rft.au=Yuan%2C+Jinjiang&rft.date=2023-08-01&rft.issn=0377-2217&rft.volume=308&rft.issue=3&rft.spage=1074&rft.epage=1090&rft_id=info:doi/10.1016%2Fj.ejor.2023.01.026&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2023_01_026 |
| 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 |