Single machine batch scheduling with resource dependent setup and processing times
Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time common for all batches. Both the job processing times and the setup...
Uložené v:
| Vydané v: | European journal of operational research Ročník 135; číslo 1; s. 177 - 183 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
16.11.2001
Elsevier |
| Edícia: | European Journal of Operational Research |
| Predmet: | |
| ISSN: | 0377-2217, 1872-6860 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time common for all batches. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that for the jobs. Polynomial time algorithms are presented to find an optimal batch sequence and resource values such that either the total weighted resource consumption is minimized, subject to meeting job deadlines, or the maximum job lateness is minimized, subject to an upper bound on the total weighted resource consumption. The algorithms are based on linear programming formulations of the corresponding problems. |
|---|---|
| AbstractList | Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in the batch is finished. Processing of a batch requires a machine setup time common for all batches. Both the job processing times and the setup time can be compressed through allocation of a continuously divisible resource. Each job uses the same amount of the resource. Each setup also uses the same amount of the resource, which may be different from that for the jobs. Polynomial time algorithms are presented to find an optimal batch sequence and resource values such that either the total weighted resource consumption is minimized, subject to meeting job deadlines, or the maximum job lateness is minimized, subject to an upper bound on the total weighted resource consumption. The algorithms are based on linear programming formulations of the corresponding problems. |
| Author | Cheng, T.C.Edwin Kovalyov, Mikhail Y. Janiak, Adam |
| Author_xml | – sequence: 1 givenname: T.C.Edwin surname: Cheng fullname: Cheng, T.C.Edwin organization: Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong – sequence: 2 givenname: Adam surname: Janiak fullname: Janiak, Adam organization: Institute of Engineering Cybernetics, Technical University of Wroclaw, Wroclaw, Poland – sequence: 3 givenname: Mikhail Y. surname: Kovalyov fullname: Kovalyov, Mikhail Y. email: koval@newman.bas-net.by organization: Institute of Engineering Cybernetics, National Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus |
| BackLink | http://econpapers.repec.org/article/eeeejores/v_3a135_3ay_3a2001_3ai_3a1_3ap_3a177-183.htm$$DView record in RePEc |
| BookMark | eNqFkNFLHDEQxkNR8NT-CUIe7cPaSXLZ3cMHKdLaUkGoLfgW4mTiRu6yS5Kz-N-b9YoPfTEw-SCZ78fMd8j24hiJsRMBZwJE-_kWVNc1UoruFOATgBKyufvAFqLvZNP2LeyxxVvLATvM-REAhBZ6wX7dhviwJr6xOIRI_N4WHHjGgdx2Xb_431AGniiP24TEHU0UHcXCM5XtxG10fEojUs5zcwkbysds39t1po__9Ij9-fb19-X35vrm6sfll-sGl3JVmrZVHoV3GqVQq-WqhR607TtEsKitkt5qr6y975yVvhW0dNp7ix5W6Hxr1RH7ueOmOhSaKYWNTc-G6nkc68TmySgrlK73cy1ZV64S5sda06xdZ0SvzFA2laZ3NExjzon8G1CAmWM2rzGbOUMDYF5jNnfVd_6fD0OxJYyxJBvW77ovdm6qQT0FSiZjoIjkQiIsxo3hHcILvKWa8g |
| CitedBy_id | crossref_primary_10_1007_s10951_015_0440_2 crossref_primary_10_1016_j_cie_2007_02_005 crossref_primary_10_1016_j_ejor_2006_06_060 crossref_primary_10_1007_s10951_007_0025_9 crossref_primary_10_1016_j_ejor_2006_07_005 crossref_primary_10_1088_1757_899X_790_1_012093 crossref_primary_10_1016_j_future_2019_01_006 crossref_primary_10_1016_S1874_1029_08_60110_X crossref_primary_10_1080_0305215X_2018_1552269 crossref_primary_10_1007_s10479_004_5030_1 crossref_primary_10_1016_j_ejor_2002_11_004 crossref_primary_10_1016_j_ipl_2014_06_009 crossref_primary_10_1016_j_ejor_2013_08_013 crossref_primary_10_3724_SP_J_1004_2009_01290 crossref_primary_10_1109_TEVC_2014_2382135 crossref_primary_10_1007_s11590_012_0535_z crossref_primary_10_1016_j_ejor_2010_01_005 crossref_primary_10_1080_00207543_2014_975866 crossref_primary_10_1016_j_asoc_2012_10_021 crossref_primary_10_1016_j_ejor_2003_10_024 crossref_primary_10_1057_palgrave_jors_2601537 crossref_primary_10_1016_j_cor_2021_105381 crossref_primary_10_1080_00207543_2010_523724 crossref_primary_10_1007_s00521_014_1778_7 crossref_primary_10_1007_s10700_004_5870_9 crossref_primary_10_1177_2041297510393449 crossref_primary_10_1016_S0305_0548_03_00187_4 crossref_primary_10_1080_00207543_2024_2432473 crossref_primary_10_1016_S0377_2217_02_00732_4 crossref_primary_10_1016_j_ejor_2018_02_059 crossref_primary_10_1007_s10951_005_6813_1 crossref_primary_10_1016_j_cie_2011_12_021 crossref_primary_10_1080_09720510_2005_10701179 crossref_primary_10_1016_j_cie_2010_10_012 crossref_primary_10_1080_0951192X_2014_934293 |
| Cites_doi | 10.1016/0167-6377(94)90063-9 10.1016/0167-6377(95)00011-8 10.1016/0377-2217(91)90065-4 10.1016/0005-1098(86)90014-2 10.1016/0377-2217(96)00129-4 10.1016/S0377-2217(99)00153-8 10.1137/S1052623495288192 10.1016/S0167-6377(97)00010-2 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.3.CO;2-B 10.1287/opre.43.4.692 10.1057/jors.1992.66 10.1109/9.293187 |
| ContentType | Journal Article |
| Copyright | 2001 Elsevier Science B.V. |
| Copyright_xml | – notice: 2001 Elsevier Science B.V. |
| DBID | AAYXX CITATION DKI X2L |
| DOI | 10.1016/S0377-2217(00)00312-X |
| DatabaseName | CrossRef RePEc IDEAS RePEc |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 183 |
| ExternalDocumentID | eeeejores_v_3a135_3ay_3a2001_3ai_3a1_3ap_3a177_183_htm 10_1016_S0377_2217_00_00312_X S037722170000312X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADIYS ADJOM ADMUD AEBSH AEFWE AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 02 08R 0R 1 41 6XO 8P AAPBV ABFLS ADALY DKI G- HZ IPNFZ K M MS PQEST STF X X2L |
| ID | FETCH-LOGICAL-c429t-663fc1fd5c21394960805a87cc0ac5a32fa5f3aab7da2f61e4d5ffacf09cdf6a3 |
| ISICitedReferencesCount | 37 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000171073600014&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 | Wed Aug 18 03:50:57 EDT 2021 Sat Nov 29 02:29:43 EST 2025 Tue Nov 18 22:20:19 EST 2025 Fri Feb 23 02:30:22 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Batching Linear programming Scheduling Polynomial algorithm Resource allocation |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c429t-663fc1fd5c21394960805a87cc0ac5a32fa5f3aab7da2f61e4d5ffacf09cdf6a3 |
| PageCount | 7 |
| ParticipantIDs | repec_primary_eeeejores_v_3a135_3ay_3a2001_3ai_3a1_3ap_3a177_183_htm crossref_primary_10_1016_S0377_2217_00_00312_X crossref_citationtrail_10_1016_S0377_2217_00_00312_X elsevier_sciencedirect_doi_10_1016_S0377_2217_00_00312_X |
| PublicationCentury | 2000 |
| PublicationDate | 2001-11-16 |
| PublicationDateYYYYMMDD | 2001-11-16 |
| PublicationDate_xml | – month: 11 year: 2001 text: 2001-11-16 day: 16 |
| PublicationDecade | 2000 |
| PublicationSeriesTitle | European Journal of Operational Research |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2001 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Dantzig (BIB7) 1963 Blazewicz, Ecker, Pesch, Schmidt, Weglarz (BIB1) 1996 Hochbaum, Landy (BIB8) 1994; 16 Li, Sewell, Cheng (BIB13) 1994; 42 Cheng, Janiak, Kovalyov (BIB4) 1998; 8 Janiak (BIB9) 1986; 22 Cheng, Janiak (BIB3) 1994; 39 Janiak (BIB10) 1991; 53 Potts, Kovalyov (BIB14) 2000; 120 A. Janiak, M.-C. Portmann, Minimization of the maximum lateness in single machine scheduling with release dates and additional resources, in: Proceedings of the International Conference on Industrial Engineering and Production Management, Lyon, France, 20–24 October 1997, Book I, pp. 283–292 Webster, Baker (BIB16) 1995; 43 Chen, Lu, Tang (BIB6) 1997; 21 Janiak, Kovalyov (BIB11) 1996; 94 Cheng, Kovalyov (BIB5) 1995; 17 Cheng, Chen, Li, Lin (BIB2) 1998; 45 Potts, Van Wassenhove (BIB15) 1991; 43 Cheng (10.1016/S0377-2217(00)00312-X_BIB3) 1994; 39 Cheng (10.1016/S0377-2217(00)00312-X_BIB2) 1998; 45 Janiak (10.1016/S0377-2217(00)00312-X_BIB10) 1991; 53 Li (10.1016/S0377-2217(00)00312-X_BIB13) 1994; 42 Cheng (10.1016/S0377-2217(00)00312-X_BIB5) 1995; 17 Hochbaum (10.1016/S0377-2217(00)00312-X_BIB8) 1994; 16 Janiak (10.1016/S0377-2217(00)00312-X_BIB11) 1996; 94 Cheng (10.1016/S0377-2217(00)00312-X_BIB4) 1998; 8 Dantzig (10.1016/S0377-2217(00)00312-X_BIB7) 1963 Chen (10.1016/S0377-2217(00)00312-X_BIB6) 1997; 21 Janiak (10.1016/S0377-2217(00)00312-X_BIB9) 1986; 22 Potts (10.1016/S0377-2217(00)00312-X_BIB14) 2000; 120 Potts (10.1016/S0377-2217(00)00312-X_BIB15) 1991; 43 10.1016/S0377-2217(00)00312-X_BIB12 Blazewicz (10.1016/S0377-2217(00)00312-X_BIB1) 1996 Webster (10.1016/S0377-2217(00)00312-X_BIB16) 1995; 43 |
| References_xml | – volume: 16 start-page: 79 year: 1994 end-page: 86 ident: BIB8 article-title: Scheduling with batching: Minimizing the weighted number of tardy jobs publication-title: Operations Research Letters – volume: 42 start-page: 946 year: 1994 end-page: 966 ident: BIB13 article-title: Scheduling to minimize release-time resource consumption and tardiness penalties publication-title: Naval Research Logistics – reference: A. Janiak, M.-C. Portmann, Minimization of the maximum lateness in single machine scheduling with release dates and additional resources, in: Proceedings of the International Conference on Industrial Engineering and Production Management, Lyon, France, 20–24 October 1997, Book I, pp. 283–292 – volume: 43 start-page: 395 year: 1991 end-page: 406 ident: BIB15 article-title: Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity publication-title: Journal of the Operational Research Society – year: 1996 ident: BIB1 publication-title: Scheduling Computer and Manufacturing Processes – volume: 21 start-page: 69 year: 1997 end-page: 76 ident: BIB6 article-title: Single machine scheduling with discretely controllable processing times publication-title: Operations Research Letters – volume: 94 start-page: 284 year: 1996 end-page: 291 ident: BIB11 article-title: Single machine scheduling with deadlines and resource dependent processing times publication-title: European Journal of Operational Research – volume: 43 start-page: 692 year: 1995 end-page: 703 ident: BIB16 article-title: Scheduling groups of jobs on a single machine publication-title: Operations Research – volume: 39 start-page: 1243 year: 1994 end-page: 1246 ident: BIB3 article-title: Resource optimal control in single-machine scheduling with completion time constraints publication-title: IEEE Transactions on Automatic Control – volume: 17 start-page: 243 year: 1995 end-page: 249 ident: BIB5 article-title: Single machine batch scheduling with deadlines and resource dependent processing times publication-title: Operations Research Letters – volume: 120 start-page: 228 year: 2000 end-page: 249 ident: BIB14 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research – volume: 45 start-page: 67 year: 1998 end-page: 82 ident: BIB2 article-title: Single machine scheduling to minimize the sum of compression and late costs publication-title: Naval Research Logistics – volume: 53 start-page: 317 year: 1991 end-page: 325 ident: BIB10 article-title: Single machine scheduling problem with a common deadline and resource dependent release dates publication-title: European Journal of Operational Research – volume: 22 start-page: 745 year: 1986 end-page: 747 ident: BIB9 article-title: Time-optimal control in a single machine problem with resource constraints publication-title: Automatica – year: 1963 ident: BIB7 publication-title: Linear Programming and Extensions – volume: 8 start-page: 617 year: 1998 end-page: 630 ident: BIB4 article-title: Bicriterion single machine scheduling with resource dependent processing times publication-title: SIAM Journal on Optimization – volume: 16 start-page: 79 year: 1994 ident: 10.1016/S0377-2217(00)00312-X_BIB8 article-title: Scheduling with batching: Minimizing the weighted number of tardy jobs publication-title: Operations Research Letters doi: 10.1016/0167-6377(94)90063-9 – volume: 17 start-page: 243 year: 1995 ident: 10.1016/S0377-2217(00)00312-X_BIB5 article-title: Single machine batch scheduling with deadlines and resource dependent processing times publication-title: Operations Research Letters doi: 10.1016/0167-6377(95)00011-8 – volume: 53 start-page: 317 year: 1991 ident: 10.1016/S0377-2217(00)00312-X_BIB10 article-title: Single machine scheduling problem with a common deadline and resource dependent release dates publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90065-4 – volume: 22 start-page: 745 year: 1986 ident: 10.1016/S0377-2217(00)00312-X_BIB9 article-title: Time-optimal control in a single machine problem with resource constraints publication-title: Automatica doi: 10.1016/0005-1098(86)90014-2 – volume: 42 start-page: 946 year: 1994 ident: 10.1016/S0377-2217(00)00312-X_BIB13 article-title: Scheduling to minimize release-time resource consumption and tardiness penalties publication-title: Naval Research Logistics – volume: 94 start-page: 284 year: 1996 ident: 10.1016/S0377-2217(00)00312-X_BIB11 article-title: Single machine scheduling with deadlines and resource dependent processing times publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(96)00129-4 – volume: 120 start-page: 228 year: 2000 ident: 10.1016/S0377-2217(00)00312-X_BIB14 article-title: Scheduling with batching: A review publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – year: 1996 ident: 10.1016/S0377-2217(00)00312-X_BIB1 – volume: 8 start-page: 617 year: 1998 ident: 10.1016/S0377-2217(00)00312-X_BIB4 article-title: Bicriterion single machine scheduling with resource dependent processing times publication-title: SIAM Journal on Optimization doi: 10.1137/S1052623495288192 – volume: 21 start-page: 69 year: 1997 ident: 10.1016/S0377-2217(00)00312-X_BIB6 article-title: Single machine scheduling with discretely controllable processing times publication-title: Operations Research Letters doi: 10.1016/S0167-6377(97)00010-2 – volume: 45 start-page: 67 year: 1998 ident: 10.1016/S0377-2217(00)00312-X_BIB2 article-title: Single machine scheduling to minimize the sum of compression and late costs publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.3.CO;2-B – volume: 43 start-page: 692 year: 1995 ident: 10.1016/S0377-2217(00)00312-X_BIB16 article-title: Scheduling groups of jobs on a single machine publication-title: Operations Research doi: 10.1287/opre.43.4.692 – volume: 43 start-page: 395 year: 1991 ident: 10.1016/S0377-2217(00)00312-X_BIB15 article-title: Integrating scheduling with batching and lot-sizing: A review of algorithms and complexity publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1992.66 – year: 1963 ident: 10.1016/S0377-2217(00)00312-X_BIB7 – volume: 39 start-page: 1243 year: 1994 ident: 10.1016/S0377-2217(00)00312-X_BIB3 article-title: Resource optimal control in single-machine scheduling with completion time constraints publication-title: IEEE Transactions on Automatic Control doi: 10.1109/9.293187 – ident: 10.1016/S0377-2217(00)00312-X_BIB12 |
| SSID | ssj0001515 |
| Score | 1.8808774 |
| Snippet | Jobs are processed by a single machine in batches. A batch is a set of jobs processed contiguously and completed together when the processing of all jobs in... |
| SourceID | repec crossref elsevier |
| SourceType | Index Database Enrichment Source Publisher |
| StartPage | 177 |
| SubjectTerms | Batching Linear programming Polynomial algorithm Resource allocation Scheduling |
| Title | Single machine batch scheduling with resource dependent setup and processing times |
| URI | https://dx.doi.org/10.1016/S0377-2217(00)00312-X http://econpapers.repec.org/article/eeeejores/v_3a135_3ay_3a2001_3ai_3a1_3ap_3a177-183.htm |
| Volume | 135 |
| WOSCitedRecordID | wos000171073600014&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/eLvHCXMwtV1bb9MwFLbKitB44FKYGDf5gQdQlJI498eqFMEeJsSKFJ4ix7HVQJZWWVa2n8E_5jh2nI3b2AOVklSW7Fg-X87NPucg9AJsjsALi8h2E8Fs4JJyfzcEq5UVPmWxECRRxSaiw8M4TZMPo9H3PhZmW0V1HZ-dJZv_SmpoA2LL0NlrkNsMCg3wH4gOdyA73P-J8EcgjCp5LFWekuRWDrx2ZYENCzKlMp7XRnvtrb4Ibmud8PZ0o_MGdMEDXSCViRD5nfdea7LQ0PQ-RZ08yDiZ5yuuuMlyOp8uim-lAeMBrUva8eJZQY8N41_DWpyvt-pI_9cVLSvr8_SSb8KVQXoqdLKPyYoimxAVnWn4rcpPcglYinu6uqKLEsSuqnDzC49X7oYjMzZo4rKgtXTJusROB8HWb-b_JO_MKcThgBsMlcmhMkclSyVZegONSRQkwCjHs_eL9MCId6kBdltT-vVDWNjrYU4vHeeVns-fFJ5xAwRmF5SZ5T10R1sheKbQcx-NeD1Bt_ogiAm62xf7wJr3T9DtC5krH6CPCmVYowx3KMMDyrBEGe5Rhg3KcIcyDCjDA8pwh7KH6NPbxXL-ztblOWwGSkxrg64qmCuKgBEwI3wwhWMnoHHEmENZQD0iaCA8SvOooESELveLQAjKhJOwQoTU20M79brmjxCmPsmhXxwWDvX9nFMSFpSB7suiKAh5vo_8fg0zpnPXyxIqVfZXGu6jqem2UclbruoQ9wTKtAaqNMsMwHdV1zcdQc2LOPy-rGGhs23mUQA93M_hkt8JPErZCNdGPmE4QHu2ao8fX3fKT9Du8OU9RTttc8qfoZts25YnzXMN3h-eaLq9 |
| 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+batch+scheduling+with+resource+dependent+setup+and+processing+times&rft.jtitle=European+journal+of+operational+research&rft.au=Cheng%2C+T.C.Edwin&rft.au=Janiak%2C+Adam&rft.au=Kovalyov%2C+Mikhail+Y.&rft.date=2001-11-16&rft.issn=0377-2217&rft.volume=135&rft.issue=1&rft.spage=177&rft.epage=183&rft_id=info:doi/10.1016%2FS0377-2217%2800%2900312-X&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0377_2217_00_00312_X |
| 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 |