Single machine scheduling with discretely controllable processing times
In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. In this paper, we introduce a discrete model in which job processing times are...
Gespeichert in:
| Veröffentlicht in: | Operations research letters Jg. 21; H. 2; S. 69 - 76 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Amsterdam
Elsevier B.V
01.09.1997
Elsevier |
| Schlagworte: | |
| ISSN: | 0167-6377, 1872-7468 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. In this paper, we introduce a discrete model in which job processing times are discretely controllable, i.e. the possible processing time of a job can only be controlled to be some specified lengths. Under this discrete model, we consider a class of single machine problems with the objective of minimizing the sum of the total processing cost and the cost measured by a standard criterion. We investigate most common criteria, e.g. makespan, maximum tardiness, total completion time, weighted number of tardy jobs, and total earliness-tardiness penalty. The computational complexity of each problem is analyzed, and pseudo-polynomial dynamic programming algorithms are proposed for hard problems. |
|---|---|
| AbstractList | In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be continuously controlled, i.e. it can be any number in a given interval. In this paper, we introduce a discrete model in which job processing times are discretely controllable, i.e. the possible processing time of a job can only be controlled to be some specified lengths. Under this discrete model, we consider a class of single machine problems with the objective of minimizing the sum of the total processing cost and the cost measured by a standard criterion. We investigate most common criteria, e.g. makespan, maximum tardiness, total completion time, weighted number of tardy jobs, and total earliness-tardiness penalty. The computational complexity of each problem is analyzed, and pseudo-polynomial dynamic programming algorithms are proposed for hard problems. |
| Author | Tang, Guochun Lu, Qing Chen, Zhi-Long |
| Author_xml | – sequence: 1 givenname: Zhi-Long surname: Chen fullname: Chen, Zhi-Long organization: Department of Civil Engineering & Operations Research, Princeton University, Princeton, NJ 08544, USA – sequence: 2 givenname: Qing surname: Lu fullname: Lu, Qing organization: Department of Decision Sciences, National University of Singapore, 10 Kent Ridge Crescent, Singapore 0511, Singapore – sequence: 3 givenname: Guochun surname: Tang fullname: Tang, Guochun organization: Department of Management, Shanghai Second Polytechnic University, Shanghai 200041, People's Republic of China |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2054983$$DView record in Pascal Francis |
| BookMark | eNqFkMFKAzEQhoNUsFYfQdiDBz2sJpvdzQYPIkWrUPBQPYfs7KyNpLsliUrf3mwrPXjpZQaG7x9mvlMy6voOCblg9IZRVt4uYhFpyYW4kuKaUspomh2RMatEloq8rEZkvEdOyKn3nxESFavGZLYw3YfFZKVhaTpMPCyx-bJxmPyYsEwa48FhQLtJoO-C663VdeTXrgf0fuCCWaE_I8etth7P__qEvD89vk2f0_nr7GX6ME-B8zKkUkKLtGryvKB1DoB1oVGWOS21LGWrIWMNZ0XBdR0vrrmA-IzIs6wtoEZEPiGXu71r7UHb1ukOjFdrZ1babVRGi1xWPGLFDgPXe--w3ROMqkGa2kpTgxElhdpKU1nM3f3LgQk6mOF1bezB9P0ujdHAt0GnPBjsABvjEIJqenNgwy--molR |
| CODEN | ORLED5 |
| CitedBy_id | crossref_primary_10_1007_s10951_007_0027_7 crossref_primary_10_1016_j_apm_2014_11_031 crossref_primary_10_1080_01966324_2016_1149126 crossref_primary_10_1007_s00236_022_00430_4 crossref_primary_10_1016_j_ejor_2005_11_029 crossref_primary_10_1007_s10479_004_5030_1 crossref_primary_10_1016_S0377_2217_00_00312_X crossref_primary_10_1016_j_ejor_2002_11_004 crossref_primary_10_1016_j_ejor_2021_03_034 crossref_primary_10_1080_01605682_2021_1999182 crossref_primary_10_1007_s00170_013_5012_z crossref_primary_10_1109_TEVC_2014_2382135 crossref_primary_10_1080_17509653_2007_10671009 crossref_primary_10_1016_S0925_5273_00_00040_2 crossref_primary_10_1016_j_asoc_2015_01_028 crossref_primary_10_1023_B_ANOR_0000030685_31167_11 crossref_primary_10_1016_j_ejor_2003_10_024 crossref_primary_10_1109_TC_2023_3333189 crossref_primary_10_1109_TAC_2007_910668 crossref_primary_10_1016_j_cie_2011_08_019 crossref_primary_10_1007_s11590_019_01407_y crossref_primary_10_1016_S0305_0548_03_00101_1 crossref_primary_10_1016_j_eswa_2020_113279 crossref_primary_10_1016_S0377_2217_02_00732_4 crossref_primary_10_1080_00207543_2021_1886368 crossref_primary_10_1142_S0217595910002818 crossref_primary_10_1016_j_ejor_2004_03_025 crossref_primary_10_1016_j_ijpe_2009_03_003 crossref_primary_10_1016_S0305_0548_02_00066_7 crossref_primary_10_1016_S0167_6377_01_00080_3 crossref_primary_10_1016_j_cie_2020_107024 crossref_primary_10_1016_j_cor_2008_05_009 crossref_primary_10_1016_j_ejor_2022_03_043 |
| Cites_doi | 10.1016/0377-2217(92)90144-X 10.1080/07408179608966263 10.1287/opre.30.2.391 10.1016/S0167-6377(96)00035-1 10.1287/opre.42.2.234 10.1016/0167-6377(91)90071-V 10.1016/0377-2217(93)90245-I 10.1016/0166-218X(90)90105-L 10.1287/opre.42.3.504 10.1287/mnsc.15.1.102 10.1016/S0377-2217(82)80008-8 10.1080/05695558008974515 10.1016/S0167-5060(08)70356-X 10.1287/opre.39.5.847 10.1287/opre.38.1.22 10.1287/opre.28.5.1155 |
| ContentType | Journal Article |
| Copyright | 1997 1998 INIST-CNRS |
| Copyright_xml | – notice: 1997 – notice: 1998 INIST-CNRS |
| DBID | AAYXX CITATION IQODW |
| DOI | 10.1016/S0167-6377(97)00010-2 |
| DatabaseName | CrossRef Pascal-Francis |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Applied Sciences |
| EISSN | 1872-7468 |
| EndPage | 76 |
| ExternalDocumentID | 2054983 10_1016_S0167_6377_97_00010_2 S0167637797000102 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1OL 1RT 1~. 1~5 29N 4.4 457 4G. 4R4 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO ABAOU ABFNM ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNCT ACRLP ADBBV ADEZE ADGUI ADIYS ADMUD AEBSH AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SDS SES SEW SPC SPCBC SSB SSD SSW SSZ T5K TN5 WH7 WUQ XPP XSW ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH |
| ID | FETCH-LOGICAL-c336t-99cfe08d4450b4cceb5ae96406a969fac21d31553ab016b37c0107422f5cbeee3 |
| ISICitedReferencesCount | 50 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1016_S0167_6377_97_00010_2&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0167-6377 |
| IngestDate | Mon Jul 21 09:15:51 EDT 2025 Sat Nov 29 02:30:06 EST 2025 Tue Nov 18 22:22:38 EST 2025 Fri Feb 23 02:20:42 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | NP-hardness Dynamic programming Discretely controllable processing times Single machine scheduling Algorithms NP hard problem Production Scheduling Computational complexity Single machine |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c336t-99cfe08d4450b4cceb5ae96406a969fac21d31553ab016b37c0107422f5cbeee3 |
| PageCount | 8 |
| ParticipantIDs | pascalfrancis_primary_2054983 crossref_primary_10_1016_S0167_6377_97_00010_2 crossref_citationtrail_10_1016_S0167_6377_97_00010_2 elsevier_sciencedirect_doi_10_1016_S0167_6377_97_00010_2 |
| PublicationCentury | 1900 |
| PublicationDate | 1997-09-01 |
| PublicationDateYYYYMMDD | 1997-09-01 |
| PublicationDate_xml | – month: 09 year: 1997 text: 1997-09-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Operations research letters |
| PublicationYear | 1997 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Hall, Kubiak, Sethi (BIB10) 1991; 39 Trick (BIB16) 1994; 42 Garey, Johnson (BIB8) 1978 T.C.E. Cheng, Z.-L. Chen, C.-L. Li and B.M.T. Lin, Scheduling to minimize the total compression and late costs, in submission. Karp (BIB11) 1972 Panwalkar, Smith, Seidman (BIB15) 1982; 30 Zdrzalka (BIB20) 1991; 10 Moore (BIB12) 1968; 15 Vickson (BIB18) 1980; 28 Vickson (BIB19) 1980; 12 Graham, Lawler, Lenstra, Kan (BIB9) 1979; 5 Alidaee, Ahmadian (BIB2) 1993; 70 Van Wassenhove, Baker (BIB17) 1982; 11 Panwalkar, Rajagoplan (BIB14) 1992; 59 Baker, Scudder (BIB3) 1990; 38 Cheng, Chen, Li (BIB4) 1996; 28 Ahuja, Magnanti, Orlin (BIB1) 1993 Daniels, Mazzola (BIB7) 1994; 42 Cheng, Chen, Li (BIB5) 1996; 19 Nowicki, Zdrzalka (BIB13) 1990; 25 Cheng (10.1016/S0167-6377(97)00010-2_BIB5) 1996; 19 Alidaee (10.1016/S0167-6377(97)00010-2_BIB2) 1993; 70 Nowicki (10.1016/S0167-6377(97)00010-2_BIB13) 1990; 25 Trick (10.1016/S0167-6377(97)00010-2_BIB16) 1994; 42 Vickson (10.1016/S0167-6377(97)00010-2_BIB18) 1980; 28 Hall (10.1016/S0167-6377(97)00010-2_BIB10) 1991; 39 Van Wassenhove (10.1016/S0167-6377(97)00010-2_BIB17) 1982; 11 10.1016/S0167-6377(97)00010-2_BIB6 Daniels (10.1016/S0167-6377(97)00010-2_BIB7) 1994; 42 Moore (10.1016/S0167-6377(97)00010-2_BIB12) 1968; 15 Panwalkar (10.1016/S0167-6377(97)00010-2_BIB14) 1992; 59 Vickson (10.1016/S0167-6377(97)00010-2_BIB19) 1980; 12 Garey (10.1016/S0167-6377(97)00010-2_BIB8) 1978 Baker (10.1016/S0167-6377(97)00010-2_BIB3) 1990; 38 Ahuja (10.1016/S0167-6377(97)00010-2_BIB1) 1993 Karp (10.1016/S0167-6377(97)00010-2_BIB11) 1972 Cheng (10.1016/S0167-6377(97)00010-2_BIB4) 1996; 28 Graham (10.1016/S0167-6377(97)00010-2_BIB9) 1979; 5 Panwalkar (10.1016/S0167-6377(97)00010-2_BIB15) 1982; 30 Zdrzalka (10.1016/S0167-6377(97)00010-2_BIB20) 1991; 10 |
| References_xml | – volume: 19 start-page: 237 year: 1996 end-page: 242 ident: BIB5 article-title: Single-machine scheduling with trade-off between number of tardy Jobs and resource allocation publication-title: Oper. Res. Lett. – volume: 28 start-page: 1155 year: 1980 end-page: 1167 ident: BIB18 article-title: Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine publication-title: Oper. Res. – volume: 38 start-page: 22 year: 1990 end-page: 36 ident: BIB3 article-title: Sequencing with earliness and tardiness penalties: a review publication-title: Oper. Res. – volume: 70 start-page: 335 year: 1993 end-page: 341 ident: BIB2 article-title: Two parallel machine sequencing problems involving controllable job processing times publication-title: European J. Oper. Res. – volume: 15 start-page: 334 year: 1968 end-page: 342 ident: BIB12 article-title: An publication-title: Management Science – year: 1978 ident: BIB8 article-title: Computers and Intractability: A Guide to the Theory of NP-Hardness – volume: 10 start-page: 519 year: 1991 end-page: 524 ident: BIB20 article-title: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis publication-title: Oper. Res. Lett. – volume: 28 start-page: 177 year: 1996 end-page: 180 ident: BIB4 article-title: Parallel machine scheduling with controllable processing times publication-title: IIE Trans. – volume: 30 start-page: 391 year: 1982 end-page: 399 ident: BIB15 article-title: Common due date assignment to minimize total penalty cost for the one-machine scheduling problem publication-title: Oper. Res. – year: 1993 ident: BIB1 article-title: Network Flows: Theory, Algorithms, and Applications – volume: 42 start-page: 234 year: 1994 end-page: 248 ident: BIB16 article-title: Scheduling multiple variable-speed machines publication-title: Oper. Res. – volume: 11 start-page: 48 year: 1982 end-page: 52 ident: BIB17 article-title: A bicriterion approach to time/cost trade-offs in sequencing publication-title: European J. Oper. Res. – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: BIB9 article-title: Optimization and approximation in deterministic sequencing and scheduling: a survey publication-title: Ann. Discrete Math. – volume: 12 start-page: 258 year: 1980 end-page: 262 ident: BIB19 article-title: Two single machine sequencing problems involving controllable job processing times publication-title: AIIE Trans. – year: 1972 ident: BIB11 publication-title: Reducibility among Combinatorial Algorithms, Complexity of Computer Computations – reference: T.C.E. Cheng, Z.-L. Chen, C.-L. Li and B.M.T. Lin, Scheduling to minimize the total compression and late costs, in submission. – volume: 42 start-page: 504 year: 1994 end-page: 522 ident: BIB7 article-title: Flow shop scheduling with resource flexibility publication-title: Oper. Res. – volume: 39 start-page: 847 year: 1991 end-page: 856 ident: BIB10 article-title: Earliness-tardiness scheduling problems, II: deviation of completion times about a common due date publication-title: Oper. Res. – volume: 25 start-page: 271 year: 1990 end-page: 287 ident: BIB13 article-title: A survey of results for sequencing problems with controllable processing times publication-title: Discrete Appl. Math. – volume: 59 start-page: 298 year: 1992 end-page: 302 ident: BIB14 article-title: Single-machine sequencing with controllable processing times publication-title: European J. Oper. Res. – volume: 59 start-page: 298 year: 1992 ident: 10.1016/S0167-6377(97)00010-2_BIB14 article-title: Single-machine sequencing with controllable processing times publication-title: European J. Oper. Res. doi: 10.1016/0377-2217(92)90144-X – volume: 28 start-page: 177 year: 1996 ident: 10.1016/S0167-6377(97)00010-2_BIB4 article-title: Parallel machine scheduling with controllable processing times publication-title: IIE Trans. doi: 10.1080/07408179608966263 – volume: 30 start-page: 391 year: 1982 ident: 10.1016/S0167-6377(97)00010-2_BIB15 article-title: Common due date assignment to minimize total penalty cost for the one-machine scheduling problem publication-title: Oper. Res. doi: 10.1287/opre.30.2.391 – volume: 19 start-page: 237 year: 1996 ident: 10.1016/S0167-6377(97)00010-2_BIB5 article-title: Single-machine scheduling with trade-off between number of tardy Jobs and resource allocation publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(96)00035-1 – volume: 42 start-page: 234 year: 1994 ident: 10.1016/S0167-6377(97)00010-2_BIB16 article-title: Scheduling multiple variable-speed machines publication-title: Oper. Res. doi: 10.1287/opre.42.2.234 – volume: 10 start-page: 519 year: 1991 ident: 10.1016/S0167-6377(97)00010-2_BIB20 article-title: Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis publication-title: Oper. Res. Lett. doi: 10.1016/0167-6377(91)90071-V – volume: 70 start-page: 335 year: 1993 ident: 10.1016/S0167-6377(97)00010-2_BIB2 article-title: Two parallel machine sequencing problems involving controllable job processing times publication-title: European J. Oper. Res. doi: 10.1016/0377-2217(93)90245-I – volume: 25 start-page: 271 year: 1990 ident: 10.1016/S0167-6377(97)00010-2_BIB13 article-title: A survey of results for sequencing problems with controllable processing times publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(90)90105-L – year: 1972 ident: 10.1016/S0167-6377(97)00010-2_BIB11 – volume: 42 start-page: 504 year: 1994 ident: 10.1016/S0167-6377(97)00010-2_BIB7 article-title: Flow shop scheduling with resource flexibility publication-title: Oper. Res. doi: 10.1287/opre.42.3.504 – year: 1978 ident: 10.1016/S0167-6377(97)00010-2_BIB8 – year: 1993 ident: 10.1016/S0167-6377(97)00010-2_BIB1 – volume: 15 start-page: 334 year: 1968 ident: 10.1016/S0167-6377(97)00010-2_BIB12 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: 11 start-page: 48 year: 1982 ident: 10.1016/S0167-6377(97)00010-2_BIB17 article-title: A bicriterion approach to time/cost trade-offs in sequencing publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(82)80008-8 – volume: 12 start-page: 258 year: 1980 ident: 10.1016/S0167-6377(97)00010-2_BIB19 article-title: Two single machine sequencing problems involving controllable job processing times publication-title: AIIE Trans. doi: 10.1080/05695558008974515 – ident: 10.1016/S0167-6377(97)00010-2_BIB6 – volume: 5 start-page: 287 year: 1979 ident: 10.1016/S0167-6377(97)00010-2_BIB9 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: 39 start-page: 847 year: 1991 ident: 10.1016/S0167-6377(97)00010-2_BIB10 article-title: Earliness-tardiness scheduling problems, II: deviation of completion times about a common due date publication-title: Oper. Res. doi: 10.1287/opre.39.5.847 – volume: 38 start-page: 22 year: 1990 ident: 10.1016/S0167-6377(97)00010-2_BIB3 article-title: Sequencing with earliness and tardiness penalties: a review publication-title: Oper. Res. doi: 10.1287/opre.38.1.22 – volume: 28 start-page: 1155 year: 1980 ident: 10.1016/S0167-6377(97)00010-2_BIB18 article-title: Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine publication-title: Oper. Res. doi: 10.1287/opre.28.5.1155 |
| SSID | ssj0007818 |
| Score | 1.6777711 |
| Snippet | In the field of machine scheduling problems with controllable processing times, it is often assumed that the possible processing time of a job can be... |
| SourceID | pascalfrancis crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 69 |
| SubjectTerms | Applied sciences Discretely controllable processing times Dynamic programming Exact sciences and technology NP-hardness Operational research and scientific management Operational research. Management science Scheduling, sequencing Single machine scheduling |
| Title | Single machine scheduling with discretely controllable processing times |
| URI | https://dx.doi.org/10.1016/S0167-6377(97)00010-2 |
| Volume | 21 |
| WOSCitedRecordID | wos10_1016_S0167_6377_97_00010_2&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-7468 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007818 issn: 0167-6377 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pa9RAFB609aCUalfFaitz8NBS0qYzyWTmuJS1VUpV2sriJUxmJyiEGHbXUv9732ReJlGR1YOXEBImA3lf3q-87z1CXilbFuyY20gUJY8SYdNIilkcWQvnTJRWtu2LP55nFxdyOlXvsT3Boh0nkNW1vL1VzX8VNVwDYTvq7D-IOzwULsA5CB2OIHY4_pXgL8EYVa4s1VVJ2gOIXsGaVCHn6mi4c_CUq-9dmXrVsqcazxho2VOBFoJe67vGzrFkDpsDfT6oWh5Q8MhPziZtwcCnwyikk8-v3ZUPITkw9vyo0z7T4Lu0qmGmoaPADLORoGUFxzksqE494Rlhwwa60Y9kQSvrh778pr99KuEyPBi8bNcp2E02BXvBeqPV_aj_xZaFCkMGrqiS_C5ZZ1mqQGOvj99Mpm-Dkc5km_oNG_XkrqN-9z2V7ePOf3JbNhq9gI-p9FNQBq7J1SOyiTEFHXssbJE7th6RhxhfUNTeixF5MGg-OSJb3Q26h73H9x-TU48eiuihPXqoQw_t0UOH6KE9emiLnifk-vXk6uQswlkbkeFcLCOlTGljOUuSNC4SY2yRaqsEuHtaCVVqw45n3M2Y0gW8noJnJnalvIyVqSmstfwpWau_1vYZoUprN1Mg1oVpo3dtpYSwgM8g1OA6ybZJ0r3K3GAjejcPpcoHFYciy50EciyPiHO2TQ7DssZ3Ylm1QHZyytGd9G5iDmhbtXT3J7mGDRFWz1fcf0Hu9x_QDllbzr_ZXXLP3Cy_LOYvEYs_ANVXmAw |
| 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+discretely+controllable+processing+times&rft.jtitle=Operations+research+letters&rft.au=CHEN%2C+Z.-L&rft.au=LU%2C+Q&rft.au=TANG%2C+G&rft.date=1997-09-01&rft.pub=Elsevier&rft.issn=0167-6377&rft.volume=21&rft.issue=2&rft.spage=69&rft.epage=76&rft_id=info:doi/10.1016%2FS0167-6377%2897%2900010-2&rft.externalDBID=n%2Fa&rft.externalDocID=2054983 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0167-6377&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0167-6377&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0167-6377&client=summon |