Penalty cost constrained identical parallel machine scheduling problem
We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty. A job may be accepted to be processed or be rejected at its penalty. The ob...
Saved in:
| Published in: | Theoretical computer science Vol. 607; pp. 181 - 192 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
23.11.2015
|
| Subjects: | |
| ISSN: | 0304-3975, 1879-2294 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty. A job may be accepted to be processed or be rejected at its penalty. The objective of the problem is to partition the set of jobs into two subsets, the subset of accepted and the subset of rejected jobs, and to schedule the set of accepted jobs such that the makespan is minimized under the constraint that the total penalty of the rejected jobs is no more than a given bound. In this paper, we present a 2-approximation algorithm within strongly polynomial time for the problem. We also present a polynomial time approximation scheme whose running time is O(nmO(1ϵ2)+mn2) for the problem. Moreover, for the case where the number of machines is a fixed constant m, our results lead to a fully polynomial time approximation scheme for the problem. Our result is fairly good in the sense that in a reasonable size of jobs, our FPTAS improves previous best running time from O(nm+2/ϵm) to O(1/ϵ2m+3+mn2). |
|---|---|
| AbstractList | We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty. A job may be accepted to be processed or be rejected at its penalty. The objective of the problem is to partition the set of jobs into two subsets, the subset of accepted and the subset of rejected jobs, and to schedule the set of accepted jobs such that the makespan is minimized under the constraint that the total penalty of the rejected jobs is no more than a given bound. In this paper, we present a 2-approximation algorithm within strongly polynomial time for the problem. We also present a polynomial time approximation scheme whose running time is for the problem. Moreover, for the case where the number of machines is a fixed constant m, our results lead to a fully polynomial time approximation scheme for the problem. Our result is fairly good in the sense that in a reasonable size of jobs, our FPTAS improves previous best running time from to . We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n independent jobs, with each job having a processing time and a penalty. A job may be accepted to be processed or be rejected at its penalty. The objective of the problem is to partition the set of jobs into two subsets, the subset of accepted and the subset of rejected jobs, and to schedule the set of accepted jobs such that the makespan is minimized under the constraint that the total penalty of the rejected jobs is no more than a given bound. In this paper, we present a 2-approximation algorithm within strongly polynomial time for the problem. We also present a polynomial time approximation scheme whose running time is O(nmO(1ϵ2)+mn2) for the problem. Moreover, for the case where the number of machines is a fixed constant m, our results lead to a fully polynomial time approximation scheme for the problem. Our result is fairly good in the sense that in a reasonable size of jobs, our FPTAS improves previous best running time from O(nm+2/ϵm) to O(1/ϵ2m+3+mn2). |
| Author | Li, Jianping Chen, Zhibin Li, Weidong Zhang, Xuejie |
| Author_xml | – sequence: 1 givenname: Weidong orcidid: 0000-0002-2193-4182 surname: Li fullname: Li, Weidong email: weidong@ynu.edu.cn organization: Yunnan University, Kunming, 650091, PR China – sequence: 2 givenname: Jianping surname: Li fullname: Li, Jianping email: jianping@ynu.edu.cn organization: Yunnan University, Kunming, 650091, PR China – sequence: 3 givenname: Xuejie surname: Zhang fullname: Zhang, Xuejie email: xjzhang@ynu.edu.cn organization: Yunnan University, Kunming, 650091, PR China – sequence: 4 givenname: Zhibin surname: Chen fullname: Chen, Zhibin email: chenzhibin11@gmail.com organization: Kunming University of Science and Technology, Kunming, 650500, PR China |
| BookMark | eNp9kDtPAzEMxyNUJNrCB2C7keVKnpc7MaGKl4QEA8xRzudCqjRXkhSJb0-qMjHUgy0_frb8n5FJGAMScsnoglHWXK8XGdKCU6ZKvqBUn5Apa3VXc97JCZlSQWUtOq3OyCylNS2mdDMl968YrM8_FYwpFxdSjtYFHCo3YMgOrK-2Nlrv0VcbC5-lVyX4xGHnXfiotnHsPW7OyenK-oQXf3FO3u_v3paP9fPLw9Py9rkGIWiuFXChlEBAPgAgHXrRtrJfCQlt0ymuZdcr1XAuec-RdyvZAFWDRmAoZM_EnFwd9pa7XztM2WxcAvTeBhx3yTCtWyqFZKqM6sMoxDGliCsDLtvsxrD_0BtGzV45szZFObNXbl8qyhWS_SO30W1s_DnK3BwYLN9_O4wmgcMAOLiIkM0wuiP0L_DziPo |
| CitedBy_id | crossref_primary_10_3390_math13071023 crossref_primary_10_1007_s10878_023_01028_3 crossref_primary_10_1142_S0217595923400110 crossref_primary_10_1016_j_ejor_2025_08_035 crossref_primary_10_1007_s10878_024_01212_z crossref_primary_10_1016_j_ejor_2017_04_036 crossref_primary_10_1016_j_tcs_2017_05_033 crossref_primary_10_1002_nav_21728 crossref_primary_10_3390_math8010133 crossref_primary_10_1007_s10288_016_0339_6 crossref_primary_10_3390_math9161965 crossref_primary_10_1007_s10288_017_0356_0 crossref_primary_10_3390_math8101785 crossref_primary_10_3390_math11244883 crossref_primary_10_1007_s10878_024_01203_0 crossref_primary_10_1007_s10878_023_01032_7 crossref_primary_10_1080_00207160_2019_1711373 crossref_primary_10_1142_S0217595919500337 crossref_primary_10_3390_math10010061 crossref_primary_10_1007_s11590_021_01724_1 crossref_primary_10_3389_fenvs_2022_807359 crossref_primary_10_1007_s10878_024_01205_y crossref_primary_10_26599_TST_2023_9010146 crossref_primary_10_1016_j_ejor_2023_11_002 crossref_primary_10_1016_j_eswa_2023_120830 |
| Cites_doi | 10.1016/j.tcs.2009.12.008 10.1016/j.ejor.2008.10.006 10.1016/j.tcs.2010.02.006 10.1016/S0196-6774(03)00078-6 10.1007/s10951-012-0303-z 10.1007/s10878-010-9350-6 10.1016/j.cor.2008.12.003 10.1002/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J 10.1007/s10107-002-0324-z 10.1002/j.1538-7305.1966.tb01709.x 10.1016/j.tcs.2009.04.006 10.1145/321941.321951 10.1137/S0895480196300522 10.1007/BF01585178 10.1016/S0304-3975(00)00288-7 10.1007/s11424-007-9050-1 10.1016/S0167-5060(08)70356-X 10.1016/j.tcs.2008.02.015 10.1016/j.ejor.2007.11.047 10.1016/S0927-0507(05)80189-6 |
| ContentType | Journal Article |
| Copyright | 2015 Elsevier B.V. |
| Copyright_xml | – notice: 2015 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.tcs.2015.10.007 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 192 |
| ExternalDocumentID | 10_1016_j_tcs_2015_10_007 S0304397515008786 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 6I. 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c330t-5c23553ece2dcce0db3884bf34c86952749b5562242b2e29f46c05d7ec1e34b13 |
| ISICitedReferencesCount | 31 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000366767500006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Sun Sep 28 09:12:18 EDT 2025 Tue Nov 18 22:25:56 EST 2025 Sat Nov 29 05:15:21 EST 2025 Fri Feb 23 02:30:22 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Fully polynomial time approximation scheme Approximation algorithms Polynomial time approximation scheme Scheduling Rejection penalty |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c330t-5c23553ece2dcce0db3884bf34c86952749b5562242b2e29f46c05d7ec1e34b13 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-2193-4182 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.tcs.2015.10.007 |
| PQID | 1778043415 |
| PQPubID | 23500 |
| PageCount | 12 |
| ParticipantIDs | proquest_miscellaneous_1778043415 crossref_citationtrail_10_1016_j_tcs_2015_10_007 crossref_primary_10_1016_j_tcs_2015_10_007 elsevier_sciencedirect_doi_10_1016_j_tcs_2015_10_007 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-11-23 |
| PublicationDateYYYYMMDD | 2015-11-23 |
| PublicationDate_xml | – month: 11 year: 2015 text: 2015-11-23 day: 23 |
| PublicationDecade | 2010 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Lu, Feng, Li (br0180) 2010; 411 Zhang, Ren, Wang (br0250) 2009; vol. 5573 Lu, Cheng, Yuan, Zhang (br0170) 2009; 36 Shmoys, Tardos (br0220) 1993; 62 Cao, Zhang (br0050) 2007; 20 Graham (br0080) 1966; 45 Graham, Lawler, Lenstra (br0090) 1979; 4 Alon, Azar, Woeginger, Yadid (br0010) 1998; 1 Horowitz, Sahni (br0120) 1976; 23 Zhang, Lu, Yuan (br0240) 2010; 411 Lawler, Lenstra, Kan, Rinnooy, Shmoys (br0140) 1993; vol. 4 Lin, Vitter (br0150) 1992 Seiden (br0190) 2001; 262 Jansen, Porkolab (br0130) 1999 Angel, Bampis, Kononov (br0020) 2001; vol. 2161 Cao, Yang (br0040) 2009; 410 Engels, Karger, Kolliopoulos, Sengupta, Uma, Wein (br0070) 2003; 49 Zhang, Lu, Yuan (br0230) 2009; 198 Bartal, Leonardi, Spaccamela, Sgall, Stougie (br0030) 2000; 13 Shabtay, Gaspar, Yedidsion (br0200) 2012; 23 Lu, Zhang, Yuan (br0160) 2008; 396 Shabtay, Gaspar, Kaspi (br0210) 2013; 16 Cheng, Sun (br0060) 2009; 194 Hoogeveen, Skutella, Woeginger (br0110) 2003; 94 Graham (10.1016/j.tcs.2015.10.007_br0080) 1966; 45 Engels (10.1016/j.tcs.2015.10.007_br0070) 2003; 49 Lu (10.1016/j.tcs.2015.10.007_br0160) 2008; 396 Shmoys (10.1016/j.tcs.2015.10.007_br0220) 1993; 62 Cao (10.1016/j.tcs.2015.10.007_br0040) 2009; 410 Seiden (10.1016/j.tcs.2015.10.007_br0190) 2001; 262 Lu (10.1016/j.tcs.2015.10.007_br0180) 2010; 411 Shabtay (10.1016/j.tcs.2015.10.007_br0210) 2013; 16 Lawler (10.1016/j.tcs.2015.10.007_br0140) 1993; vol. 4 Shabtay (10.1016/j.tcs.2015.10.007_br0200) 2012; 23 Cheng (10.1016/j.tcs.2015.10.007_br0060) 2009; 194 Graham (10.1016/j.tcs.2015.10.007_br0090) 1979; 4 Horowitz (10.1016/j.tcs.2015.10.007_br0120) 1976; 23 Bartal (10.1016/j.tcs.2015.10.007_br0030) 2000; 13 Jansen (10.1016/j.tcs.2015.10.007_br0130) 1999 Cao (10.1016/j.tcs.2015.10.007_br0050) 2007; 20 Angel (10.1016/j.tcs.2015.10.007_br0020) 2001; vol. 2161 Alon (10.1016/j.tcs.2015.10.007_br0010) 1998; 1 Hoogeveen (10.1016/j.tcs.2015.10.007_br0110) 2003; 94 Lu (10.1016/j.tcs.2015.10.007_br0170) 2009; 36 Lin (10.1016/j.tcs.2015.10.007_br0150) 1992 Zhang (10.1016/j.tcs.2015.10.007_br0240) 2010; 411 Zhang (10.1016/j.tcs.2015.10.007_br0250) 2009; vol. 5573 Zhang (10.1016/j.tcs.2015.10.007_br0230) 2009; 198 |
| References_xml | – volume: 194 start-page: 18 year: 2009 end-page: 27 ident: br0060 article-title: Scheduling linear deteriorating jobs with rejection on a single machine publication-title: European J. Oper. Res. – volume: 23 start-page: 395 year: 2012 end-page: 424 ident: br0200 article-title: A bicriteria approach to scheduling a single machine with job rejection and positional penalties publication-title: J. Comb. Optim. – volume: vol. 2161 start-page: 194 year: 2001 end-page: 205 ident: br0020 article-title: A FPTAS for approximating the unrelated parallel machines scheduling problem with costs publication-title: ESA 2001 – volume: 20 start-page: 529 year: 2007 end-page: 535 ident: br0050 article-title: Scheduling with rejection and non-identical job arrivals publication-title: J. Syst. Sci. Complex. – volume: 62 start-page: 461 year: 1993 end-page: 474 ident: br0220 article-title: An approximation algorithm for the generalized assignment problem publication-title: Math. Program. – volume: 16 start-page: 3 year: 2013 end-page: 28 ident: br0210 article-title: A survey on offline scheduling with rejection publication-title: J. Sched. – volume: 4 start-page: 287 year: 1979 end-page: 326 ident: br0090 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. – volume: 396 start-page: 283 year: 2008 end-page: 289 ident: br0160 article-title: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan publication-title: Theoret. Comput. Sci. – volume: 1 start-page: 55 year: 1998 end-page: 66 ident: br0010 article-title: Approximation schemes for scheduling on parallel machines publication-title: J. Sched. – volume: 411 start-page: 1877 year: 2010 end-page: 1882 ident: br0240 article-title: Single-machine scheduling under the job rejection constraint publication-title: Theoret. Comput. Sci. – volume: 411 start-page: 1140 year: 2010 end-page: 1145 ident: br0180 article-title: Minimizing the makespan on a single parallel batching machine publication-title: Theoret. Comput. Sci. – start-page: 408 year: 1999 end-page: 417 ident: br0130 article-title: Improved approximation schemes for scheduling unrelated parallel machines publication-title: Proceedings of STOS'99 – volume: 13 start-page: 64 year: 2000 end-page: 78 ident: br0030 article-title: Multiprocessor scheduling with rejection publication-title: SIAM J. Discrete Math. – volume: 45 start-page: 1563 year: 1966 end-page: 1581 ident: br0080 article-title: Bounds for certain multiprocessing anomalies publication-title: Bell Syst. Tech. J. – volume: 198 start-page: 975 year: 2009 end-page: 978 ident: br0230 article-title: Single machine scheduling with release dates and rejection publication-title: European J. Oper. Res. – volume: 23 start-page: 317 year: 1976 end-page: 327 ident: br0120 article-title: Exact and approximate algorithms for scheduling nonidentical processors publication-title: J. ACM – start-page: 771 year: 1992 end-page: 782 ident: br0150 article-title: -Approximation algorithms with minimum packing constraint violation publication-title: Proceedings of STOS'92 – volume: 49 start-page: 175 year: 2003 end-page: 191 ident: br0070 article-title: Techniques for scheduling with rejection publication-title: J. Algorithms – volume: vol. 4 start-page: 445 year: 1993 end-page: 452 ident: br0140 article-title: Sequencing and scheduling: algorithms and complexity publication-title: Handbooks in Operations Research and Management Science – volume: vol. 5573 start-page: 411 year: 2009 end-page: 420 ident: br0250 article-title: Scheduling with rejection to minimize the makespan publication-title: COCOA 2009 – volume: 94 start-page: 361 year: 2003 end-page: 374 ident: br0110 article-title: Preemptive scheduling with rejection publication-title: Math. Program. – volume: 262 start-page: 437 year: 2001 end-page: 458 ident: br0190 article-title: Preemptive multiprocessor scheduling with rejection publication-title: Theoret. Comput. Sci. – volume: 410 start-page: 2732 year: 2009 end-page: 2745 ident: br0040 article-title: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals publication-title: Theoret. Comput. Sci. – volume: 36 start-page: 2748 year: 2009 end-page: 2751 ident: br0170 article-title: Bounded single-machine parallel-batch scheduling with release dates and rejection publication-title: Comput. Oper. Res. – volume: 411 start-page: 1140 year: 2010 ident: 10.1016/j.tcs.2015.10.007_br0180 article-title: Minimizing the makespan on a single parallel batching machine publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2009.12.008 – volume: 198 start-page: 975 year: 2009 ident: 10.1016/j.tcs.2015.10.007_br0230 article-title: Single machine scheduling with release dates and rejection publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2008.10.006 – volume: 411 start-page: 1877 year: 2010 ident: 10.1016/j.tcs.2015.10.007_br0240 article-title: Single-machine scheduling under the job rejection constraint publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2010.02.006 – start-page: 408 year: 1999 ident: 10.1016/j.tcs.2015.10.007_br0130 article-title: Improved approximation schemes for scheduling unrelated parallel machines – start-page: 771 year: 1992 ident: 10.1016/j.tcs.2015.10.007_br0150 article-title: ϵ-Approximation algorithms with minimum packing constraint violation – volume: vol. 5573 start-page: 411 year: 2009 ident: 10.1016/j.tcs.2015.10.007_br0250 article-title: Scheduling with rejection to minimize the makespan – volume: 49 start-page: 175 year: 2003 ident: 10.1016/j.tcs.2015.10.007_br0070 article-title: Techniques for scheduling with rejection publication-title: J. Algorithms doi: 10.1016/S0196-6774(03)00078-6 – volume: 16 start-page: 3 year: 2013 ident: 10.1016/j.tcs.2015.10.007_br0210 article-title: A survey on offline scheduling with rejection publication-title: J. Sched. doi: 10.1007/s10951-012-0303-z – volume: 23 start-page: 395 year: 2012 ident: 10.1016/j.tcs.2015.10.007_br0200 article-title: A bicriteria approach to scheduling a single machine with job rejection and positional penalties publication-title: J. Comb. Optim. doi: 10.1007/s10878-010-9350-6 – volume: vol. 2161 start-page: 194 year: 2001 ident: 10.1016/j.tcs.2015.10.007_br0020 article-title: A FPTAS for approximating the unrelated parallel machines scheduling problem with costs – volume: 36 start-page: 2748 year: 2009 ident: 10.1016/j.tcs.2015.10.007_br0170 article-title: Bounded single-machine parallel-batch scheduling with release dates and rejection publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.12.003 – volume: 1 start-page: 55 year: 1998 ident: 10.1016/j.tcs.2015.10.007_br0010 article-title: Approximation schemes for scheduling on parallel machines publication-title: J. Sched. doi: 10.1002/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J – volume: 94 start-page: 361 year: 2003 ident: 10.1016/j.tcs.2015.10.007_br0110 article-title: Preemptive scheduling with rejection publication-title: Math. Program. doi: 10.1007/s10107-002-0324-z – volume: 45 start-page: 1563 year: 1966 ident: 10.1016/j.tcs.2015.10.007_br0080 article-title: Bounds for certain multiprocessing anomalies publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1966.tb01709.x – volume: 410 start-page: 2732 year: 2009 ident: 10.1016/j.tcs.2015.10.007_br0040 article-title: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2009.04.006 – volume: 23 start-page: 317 year: 1976 ident: 10.1016/j.tcs.2015.10.007_br0120 article-title: Exact and approximate algorithms for scheduling nonidentical processors publication-title: J. ACM doi: 10.1145/321941.321951 – volume: 13 start-page: 64 year: 2000 ident: 10.1016/j.tcs.2015.10.007_br0030 article-title: Multiprocessor scheduling with rejection publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480196300522 – volume: 62 start-page: 461 year: 1993 ident: 10.1016/j.tcs.2015.10.007_br0220 article-title: An approximation algorithm for the generalized assignment problem publication-title: Math. Program. doi: 10.1007/BF01585178 – volume: 262 start-page: 437 year: 2001 ident: 10.1016/j.tcs.2015.10.007_br0190 article-title: Preemptive multiprocessor scheduling with rejection publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(00)00288-7 – volume: 20 start-page: 529 year: 2007 ident: 10.1016/j.tcs.2015.10.007_br0050 article-title: Scheduling with rejection and non-identical job arrivals publication-title: J. Syst. Sci. Complex. doi: 10.1007/s11424-007-9050-1 – volume: 4 start-page: 287 year: 1979 ident: 10.1016/j.tcs.2015.10.007_br0090 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. doi: 10.1016/S0167-5060(08)70356-X – volume: 396 start-page: 283 year: 2008 ident: 10.1016/j.tcs.2015.10.007_br0160 article-title: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2008.02.015 – volume: 194 start-page: 18 year: 2009 ident: 10.1016/j.tcs.2015.10.007_br0060 article-title: Scheduling linear deteriorating jobs with rejection on a single machine publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2007.11.047 – volume: vol. 4 start-page: 445 year: 1993 ident: 10.1016/j.tcs.2015.10.007_br0140 article-title: Sequencing and scheduling: algorithms and complexity doi: 10.1016/S0927-0507(05)80189-6 |
| SSID | ssj0000576 |
| Score | 2.3129392 |
| Snippet | We consider a version of parallel machine scheduling with rejection. An instance of the problem is given by m identical parallel machines and a set of n... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 181 |
| SubjectTerms | Algorithms Approximation Approximation algorithms Constants Fully polynomial time approximation scheme Mathematical analysis Polynomial time approximation scheme Polynomials Rejection Rejection penalty Running Scheduling |
| Title | Penalty cost constrained identical parallel machine scheduling problem |
| URI | https://dx.doi.org/10.1016/j.tcs.2015.10.007 https://www.proquest.com/docview/1778043415 |
| Volume | 607 |
| WOSCitedRecordID | wos000366767500006&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 (Freedom Collection) customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbbpIf20Efa0qQPVOipixdblizpGEJCG2gIdEuXXowty8SL611ib8jPz8iS7CWhoS30YpbB9sqazzOfpXkg9JFSqkmpkiBSJAkoK-NAikwEmcrAUGYhMAbbbIKfnYnFQp5PJhufC3NV86YR19dy_V9VDTJQtkmd_Qt1DzcFAfwGpcMR1A7HP1L8uYZTgFqrVduZoPK27wIBvLLqc3KNTky977rW9fRXH0qpp_CJCy7HZab3HWa2Set8K9lRuS4QU-c6h4CePirgh66KlfOFg_AUELiuRumwRr3Y6GU13OHI5Yn8vKhyVw7crUZEzKTl2YRhu0R2J03GpmaZ7RdpW6TMtLW0gsuAENvh2JvixHbAdcY0ss1cnF-ObM-8Oybfrj4sZ50y1dcjNuuD9fjo34aow29mHGYYQIJDwUXyAO0SziQYw93DL8eL09GFM243ud24_XZ4Hxh4649-R2huufaer8yfoSfuQwMfWoA8RxPd7KGnvokHdjZ9Dz3-OhTubV-gE4cebNCDt9CDB_Rgjx7s0INH9GCHnpfo-8nx_Ohz4FptBCqOwy5gigDxjLXSpFBKh0UeC0HzMqZKJJIRTmXOgCoDocuJJrKkiQpZwbWKdEzzKH6FdppVo18jnJWxppEqBScFlTQRICBUK5plrKAJ3Uehn69UuTr05lHq1AccLlOY4tRMsRHBFO-jT8Mla1uE5b6TqVdC6l4Fyw5TQMx9l33wCkvBwppts6zRq02bRtwU6QK2xw7-7dZv0KPxVXmLdrrLjX6HHqqrrmov3zvs3QA0maIA |
| 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=Penalty+cost+constrained+identical+parallel+machine+scheduling+problem&rft.jtitle=Theoretical+computer+science&rft.au=Li%2C+Weidong&rft.au=Li%2C+Jianping&rft.au=Zhang%2C+Xuejie&rft.au=Chen%2C+Zhibin&rft.date=2015-11-23&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=607&rft.spage=181&rft.epage=192&rft_id=info:doi/10.1016%2Fj.tcs.2015.10.007&rft.externalDocID=S0304397515008786 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |