Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time
The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine processes jobs of the same group contiguously, with a sequence independent setup time preceding the processing of each group. The setup time...
Saved in:
| Published in | Annals of operations research Vol. 133; no. 1-4; pp. 163 - 174 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | English |
| Published |
New York
Springer Nature B.V
01.01.2005
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0254-5330 1572-9338 |
| DOI | 10.1007/s10479-004-5030-1 |
Cover
| Abstract | The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine processes jobs of the same group contiguously, with a sequence independent setup time preceding the processing of each group. The setup times and the job processing times are controllable through the allocation of a continuously divisible or discrete resource to them. Each job uses the same amount of the resource. Each setup also uses the same amount of resource, which may be different from that for the jobs. Polynomial-time algorithms are constructed for variants of the problem of finding an optimal job sequence and resource values so as to minimize the total weighted job completion time, subject to given restrictions on resource consumption. The algorithms are based on a polynomial enumeration of the candidates for an optimal job sequence and solving the problem with a fixed job sequence by linear programming. [PUBLICATION ABSTRACT] |
|---|---|
| AbstractList | The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine processes jobs of the same group contiguously, with a sequence independent setup time preceding the processing of each group. The setup times and the job processing times are controllable through the allocation of a continuously divisible or discrete resource to them. Each job uses the same amount of the resource. Each setup also uses the same amount of resource, which may be different from that for the jobs. Polynomial-time algorithms are constructed for variants of the problem of finding an optimal job sequence and resource values so as to minimize the total weighted job completion time, subject to given restrictions on resource consumption. The algorithms are based on a polynomial enumeration of the candidates for an optimal job sequence and solving the problem with a fixed job sequence by linear programming. [PUBLICATION ABSTRACT] |
| Author | Cheng, T. C. Edwin Kovalyov, Mikhail Y. Janiak, Adam Ng, C. T. |
| Author_xml | – sequence: 1 givenname: C. T. surname: Ng fullname: Ng, C. T. – sequence: 2 givenname: T. C. Edwin surname: Cheng fullname: Cheng, T. C. Edwin – sequence: 3 givenname: Adam surname: Janiak fullname: Janiak, Adam – sequence: 4 givenname: Mikhail Y. surname: Kovalyov fullname: Kovalyov, Mikhail Y. |
| BookMark | eNp9kM1OwzAQhC1UJNrCA3CLuAfWP2kabqiCglQEUos4Wo7jNK4cO9iuEDw9ScuJA6fV7n4zu5oJGllnFUKXGK4xQH4TMLC8SAFYmgGFFJ-gMc5ykhaUzkdoDCTrN5TCGZqEsAMAjOfZGDVL7_ZdspaNqvZG223yqWOTLJyN3hkjSqOStYo9ImyVvHonVQgDttGtCrfJs7a61d-HiYvCJO9Kb5uoqt6i7YyK2tkDe45Oa2GCuvitU_T2cL9ZPKarl-XT4m6VSpKTmJJiVrGZYELmTLCS4hJykpVUyaIGUdclVpgwUc4JIxLXrM5Y3zMqKS1pLgWdoqujb-fdx16FyHdu721_khPMMigIzHooP0LSuxC8qrnUUQy_Ri-04Rj4kCo_psr7VPmQKse9Ev9Rdl63wn_9o_kB2Ix8ow |
| CitedBy_id | crossref_primary_10_1007_s10951_015_0440_2 crossref_primary_10_1016_j_ejor_2006_06_060 crossref_primary_10_1155_2015_826318 crossref_primary_10_1016_j_ijpe_2010_12_023 crossref_primary_10_1007_s12190_014_0814_1 crossref_primary_10_1016_j_ejor_2006_07_005 crossref_primary_10_1057_jors_2016_14 crossref_primary_10_1109_TASE_2019_2953669 crossref_primary_10_1016_j_future_2019_01_006 crossref_primary_10_1016_j_ins_2018_11_023 crossref_primary_10_1016_j_apm_2010_03_014 crossref_primary_10_1016_S1874_1029_08_60110_X crossref_primary_10_1016_j_ejor_2010_02_026 crossref_primary_10_1080_07408170903394322 crossref_primary_10_1016_j_ejor_2021_03_034 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_cor_2024_106552 crossref_primary_10_1007_s00170_011_3318_2 crossref_primary_10_1057_s41274_016_0010_9 crossref_primary_10_1007_s10878_009_9270_5 crossref_primary_10_1007_s10951_010_0208_7 crossref_primary_10_1016_j_cie_2018_01_002 crossref_primary_10_1007_s00170_009_2224_3 crossref_primary_10_1080_00207543_2010_523724 crossref_primary_10_1007_s00521_014_1778_7 crossref_primary_10_1016_j_ijpe_2008_05_004 crossref_primary_10_1016_j_cie_2013_11_017 crossref_primary_10_1287_msom_1060_0139 crossref_primary_10_1007_s10951_024_00826_9 crossref_primary_10_1002_nav_21472 crossref_primary_10_1080_00207543_2015_1058538 crossref_primary_10_1016_j_dam_2007_02_003 crossref_primary_10_1016_j_cie_2010_10_012 crossref_primary_10_1002_nav_21731 crossref_primary_10_1016_j_cor_2006_09_008 crossref_primary_10_1016_j_cor_2010_03_012 crossref_primary_10_1016_j_ijpe_2011_09_011 crossref_primary_10_1016_j_disopt_2006_04_003 |
| Cites_doi | 10.1016/0041-5553(84)90181-2 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.0.CO;2-J 10.1016/0377-2217(96)00129-4 10.1007/BF02099697 10.1109/9.293187 10.1023/A:1009841719644 10.1016/S0377-2217(00)00312-X 10.1007/978-94-009-4976-8 10.1057/jors.1992.66 10.1016/0167-6377(95)00011-8 10.1016/S0377-2217(82)80008-8 10.1016/S0167-6377(97)00010-2 10.1007/978-3-662-03217-6 10.1016/0005-1098(86)90014-2 10.1016/0377-2217(91)90065-4 10.1080/05695558008974515 10.1016/S0925-5273(96)00105-3 10.1016/S0377-2217(99)00153-8 10.1016/S0925-5273(00)00040-2 10.1016/0167-6377(92)90027-Z 10.1016/S0167-5060(08)70356-X 10.1016/j.ejor.2002.11.004 10.1002/nav.3800030106 |
| ContentType | Journal Article |
| Copyright | Springer Science + Business Media, Inc. 2005 |
| Copyright_xml | – notice: Springer Science + Business Media, Inc. 2005 |
| DBID | AAYXX CITATION 3V. 7TA 7TB 7WY 7WZ 7XB 87Z 88I 8AL 8AO 8FD 8FE 8FG 8FK 8FL ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FR3 FRNLG F~G GNUQQ HCIFZ JG9 JQ2 K60 K6~ K7- KR7 L.- L6V M0C M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PTHSS Q9U |
| DOI | 10.1007/s10479-004-5030-1 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Materials Business File Mechanical & Transportation Engineering Abstracts ABI/INFORM Collection ABI/INFORM Global (PDF only) ProQuest Central (purchase pre-March 2016) ABI/INFORM Global (Alumni Edition) Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest SciTech Premium Collection Technology Collection Materials Science & Engineering Database ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology collection ProQuest One Community College ProQuest Central Korea Engineering Research Database Business Premium Collection (Alumni) ABI/INFORM Global (Corporate) ProQuest Central Student SciTech Premium Collection Materials Research Database ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database Civil Engineering Abstracts ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Computing Database Science Database Engineering Database ProQuest advanced technologies & aerospace journals ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic ProQuest One Academic UKI Edition Engineering collection ProQuest Central Basic |
| DatabaseTitle | CrossRef Materials Research Database ProQuest Business Collection (Alumni Edition) Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ABI/INFORM Complete Materials Business File ProQuest One Applied & Life Sciences ProQuest Central (New) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest Business Collection ProQuest One Academic UKI Edition Engineering Research Database ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection Technology Research Database ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Engineering Collection ProQuest Central Korea ABI/INFORM Complete (Alumni Edition) Civil Engineering Abstracts ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1572-9338 |
| EndPage | 174 |
| ExternalDocumentID | 796940621 10_1007_s10479_004_5030_1 |
| Genre | Feature |
| GroupedDBID | -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 2.D 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 7WY 88I 8AO 8FE 8FG 8FL 8TC 8VB 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAPKM AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYXX AAYZH ABAKF ABBBX ABBRH ABBXA ABDBE ABDZT ABECU ABFSG ABFTV ABHLI ABHQN ABJCF ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSTC ACZOJ ADHHG ADHIR ADHKG ADIMF ADKFA ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AEZWR AFBBN AFDZB AFEXP AFGCZ AFHIU AFKRA AFLOW AFOHR AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGQPQ AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHPBZ AHQJS AHSBF AHWEU AHYZX AIAKS AIGIU AIIXL AILAN AITGF AIXLP AJBLW AJRNO AJZVZ AKVCP ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMVHM AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG ATHPR AVWKF AXYYD AYFIA AYQZM AZFZN AZQEC B-. BA0 BAPOH BBWZM BDATZ BENPR BEZIV BGLVJ BGNMA BPHCQ BSONS CAG CCPQU CITATION COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DWQXO EBLON EBO EBS EBU EDO EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRNLG FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ7 GQ8 GROUPED_ABI_INFORM_RESEARCH GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IAO ICD IEA IHE IJ- IKXTQ ITC ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K1G K60 K6V K6~ K7- KDC KOV KOW L6V LAK LLZTM M0C M2P M4Y M7S MA- N2Q N95 N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I OAM OVD P19 P2P P62 P9M PF0 PHGZM PHGZT PQBIZ PQBZA PQQKQ PROAC PT4 PT5 PTHSS Q2X QOK QOS QWB R4E R89 R9I RHV RNI RNS ROL RPX RSV RZC RZD RZK S16 S1Z S26 S27 S28 S3B SAP SBE SCF SCLPG SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TH9 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR Z45 ZL0 ZMTXR ZYFGU ~8M ~A9 ~EX 3V. 7TA 7TB 7XB 8AL 8FD 8FK ABRTQ FR3 JG9 JQ2 KR7 L.- M0N PKEHL PQEST PQGLB PQUKI Q9U |
| ID | FETCH-LOGICAL-c272t-296d46a4ac74a4b31b0725b3ec9f0affb1e124ab8242c1f4f5412443c33b37ca3 |
| IEDL.DBID | 8FG |
| ISSN | 0254-5330 |
| IngestDate | Fri Jul 25 19:43:41 EDT 2025 Thu Apr 24 23:02:44 EDT 2025 Tue Jul 01 01:22:29 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1-4 |
| Language | English |
| License | http://www.springer.com/tdm |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c272t-296d46a4ac74a4b31b0725b3ec9f0affb1e124ab8242c1f4f5412443c33b37ca3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 214509206 |
| PQPubID | 25585 |
| PageCount | 12 |
| ParticipantIDs | proquest_journals_214509206 crossref_citationtrail_10_1007_s10479_004_5030_1 crossref_primary_10_1007_s10479_004_5030_1 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2005-1-00 20050101 |
| PublicationDateYYYYMMDD | 2005-01-01 |
| PublicationDate_xml | – month: 01 year: 2005 text: 2005-1-00 |
| PublicationDecade | 2000 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Annals of operations research |
| PublicationYear | 2005 |
| Publisher | Springer Nature B.V |
| Publisher_xml | – name: Springer Nature B.V |
| References | T.C.E. Cheng (5385030_CR8) 2001; 135 M.M. Liaee (5385030_CR22) 1997; 51 A.V. Aho (5385030_CR1) 1974 C.L. Li (5385030_CR21) 1994; 42 T.C.E. Cheng (5385030_CR7) 1995; 17 A. Janiak (5385030_CR18) 1997 J. Błazewicz (5385030_CR3) 1996 I. Ham (5385030_CR12) 1985 A. Janiak (5385030_CR16) 1996; 94 H. Opitz (5385030_CR25) 1970 T.C.E. Cheng (5385030_CR5) 1998; 45 D. Biskup (5385030_CR2) 2001; 69 A.V. Tuzikov (5385030_CR30) 1984; 24 A. Janiak (5385030_CR14) 1991; 53 M.Y. Kovalyov (5385030_CR20) 1994; 4 L.N. Wassenhove Van (5385030_CR31) 1982; 11 G.B. Dantzig (5385030_CR10) 1963 R.W. Conway (5385030_CR9) 1967 A. Janiak (5385030_CR19) 2001; 12 Z.L. Chen (5385030_CR4) 1997; 21 Z. Liu (5385030_CR23) 1999; 3 C.N. Potts (5385030_CR27) 1991; 43 S.P. Mitrofanovo (5385030_CR24) 1966 A. Janiak (5385030_CR17) 2005; 162 A. Janiak (5385030_CR13) 1986; 22 A. Janiak (5385030_CR15) 1995; 57 W.E. Smith (5385030_CR29) 1956; 1 R.G. Vickson (5385030_CR32) 1980; 12 T.C.E. Cheng (5385030_CR6) 1994; 39 R.L. Graham (5385030_CR11) 1979; 5 D.F. Shallcross (5385030_CR28) 1992; 11 L.Y. Zamanskii (5385030_CR33) 1984; 20 C.N. Potts (5385030_CR26) 2000; 120 |
| References_xml | – volume: 24 start-page: 1585 year: 1984 ident: 5385030_CR30 publication-title: USSR Computing Mathematics and Mathematical Physics doi: 10.1016/0041-5553(84)90181-2 – volume-title: The Design and Analysis of Computer Algorithms year: 1974 ident: 5385030_CR1 – volume: 45 start-page: 67 year: 1998 ident: 5385030_CR5 publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199802)45:1<67::AID-NAV4>3.0.CO;2-J – start-page: 283 volume-title: Proceedings of the International Conference on Industrial Engineering and Production Management year: 1997 ident: 5385030_CR18 – volume: 94 start-page: 284 year: 1996 ident: 5385030_CR16 publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(96)00129-4 – volume: 20 start-page: 1132 year: 1984 ident: 5385030_CR33 publication-title: Economika i Matematicheskie Metodi – volume: 57 start-page: 191 year: 1995 ident: 5385030_CR15 publication-title: Annals of Operations Research doi: 10.1007/BF02099697 – volume: 39 start-page: 1243 year: 1994 ident: 5385030_CR6 publication-title: IEEE Transactions on Automatic Control doi: 10.1109/9.293187 – volume: 3 start-page: 5 year: 1999 ident: 5385030_CR23 publication-title: Journal of Combinatorial Optimization doi: 10.1023/A:1009841719644 – volume: 135 start-page: 177 year: 2001 ident: 5385030_CR8 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(00)00312-X – volume: 4 start-page: 635 year: 1994 ident: 5385030_CR20 publication-title: Applied Mathematics and Computer Science – volume-title: Group Technology: Applications to Production Management year: 1985 ident: 5385030_CR12 doi: 10.1007/978-94-009-4976-8 – volume: 43 start-page: 395 year: 1991 ident: 5385030_CR27 publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1992.66 – volume: 17 start-page: 243 year: 1995 ident: 5385030_CR7 publication-title: Operations Research Letters doi: 10.1016/0167-6377(95)00011-8 – volume-title: A Classification System to Describe Workpieces: Parts I and II year: 1970 ident: 5385030_CR25 – volume: 11 start-page: 48 year: 1982 ident: 5385030_CR31 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(82)80008-8 – volume: 12 start-page: 61 year: 2001 ident: 5385030_CR19 publication-title: Informatica – volume: 21 start-page: 69 year: 1997 ident: 5385030_CR4 publication-title: Operations Research Letters doi: 10.1016/S0167-6377(97)00010-2 – volume-title: Scheduling Computer and Manufacturing Processes year: 1996 ident: 5385030_CR3 doi: 10.1007/978-3-662-03217-6 – volume: 22 start-page: 745 year: 1986 ident: 5385030_CR13 publication-title: Automatica doi: 10.1016/0005-1098(86)90014-2 – volume: 42 start-page: 946 year: 1994 ident: 5385030_CR21 publication-title: Naval Research Logistics – volume-title: Linear Programming and Extensions year: 1963 ident: 5385030_CR10 – volume: 53 start-page: 317 year: 1991 ident: 5385030_CR14 publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(91)90065-4 – volume: 12 start-page: 258 year: 1980 ident: 5385030_CR32 publication-title: AIIE Transactions doi: 10.1080/05695558008974515 – volume: 51 start-page: 165 year: 1997 ident: 5385030_CR22 publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(96)00105-3 – volume: 120 start-page: 228 year: 2000 ident: 5385030_CR26 publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(99)00153-8 – volume: 69 start-page: 317 year: 2001 ident: 5385030_CR2 publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(00)00040-2 – volume: 11 start-page: 213 year: 1992 ident: 5385030_CR28 publication-title: Operations Research Letters doi: 10.1016/0167-6377(92)90027-Z – volume: 5 start-page: 287 year: 1979 ident: 5385030_CR11 publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70356-X – volume: 162 start-page: 112 year: 2005 ident: 5385030_CR17 publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2002.11.004 – volume: 1 start-page: 59 year: 1956 ident: 5385030_CR29 publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800030106 – volume-title: Theory of Scheduling year: 1967 ident: 5385030_CR9 – volume-title: Scientific Principles of Group Technology year: 1966 ident: 5385030_CR24 |
| SSID | ssj0001185 |
| Score | 1.933911 |
| Snippet | The following single machine scheduling problem is studied. A partition of a set of n jobs into g groups on the basis of group technology is given. The machine... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 163 |
| SubjectTerms | Algorithms Group technology Job shops Linear programming Operations management Production scheduling Studies |
| Title | Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time |
| URI | https://www.proquest.com/docview/214509206 |
| Volume | 133 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LSwMxEB58gOjBR1XUquTgSQjuI_vyIlqsIlhELfa25EkLdau2Xvz1ZtJstZdeN7Ms7ExmJpNvvgE448rGhQSHu0htKFPM0NzojGqTpAr5v7lrCnvspPdd9tBLeh6bM_awytonOketRhJr5BfIqB0UUZBefXxSHBqFl6t-gsYyrIY20KCZ5-27mSO2ubNDMNozEEUQZX2pOe2cY1lBEYWRWDOn4XxYmvfKLtS0t2HT54jkeqrUHVjSVQPWaoh6A7bqUQzE78wGbPzjFdyFvqso2dW-DSTYb06w3EpaU1j6ELulyIueWBFeKeJ7BVDMNYRcksdBNXgf_LgnI5udkzdXQNWK4JeRrntUOdk96LZvX1v31I9UoDLKogmNilSxlDMuM8aZiEMRZFEiYi0LE3BjRKhtwOcit5FbhoaZBKdTs1jGsYgzyeN9WKlGlT4AYg9aqsgTZTJhT1mREToueBTKtDB5znRyCEH9R0vp-cZx7MWw_GNKRiWUVgklKqEMD-F89srHlGxjkXCzVlPp9924nFnJ0cLVJqw7ClZXSjmGlcnXtz6xycVEnDoTOoXVm9vO0_Mv1ErNmw |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LTxRBEK7gkqgcRFeNCGgf9GLScaan52ViCM8swm6MQuQ29DNsArMoawz8J_4jVT0zK1y4cZ3umUm6qqu6quv7CuCDsugXUmruYpzn0krPC-9y7nyaWeL_VgEUNhxlg0P57Sg9moPrDgtDZZWdTQyG2k4M5cg_E6N2VIooWzv_zalpFF2udh00Gq3Yc5f_MGK7-Lq7heL9KMTO9sHmgLdNBbgRuZhyUWZWZkoqk0sldRLrKBepTpwpfaS817FDl6d0gb7LxF76lPozy8QkiU5yoxL87iOYlwRo7cH8xvbo-4-Z6cfTeqiZxKiLU9lmd43aYPVkXnKq-0hxY_H4riO86weCc9t5Ds_aUylbb9ToBcy5ug-Pu6L4Pix2zR9Yawv6sHCLyfAlnIQcFo6eoOsihDujBC_bbArhTwmfxX66KU5RtWUtOoGmBQjKFzYc1-Oz8VV4MsF4gP0KKVtnGf2ZCMIndZj7Cg4fZL1fQ6-e1O4NMAztbFmk1uca4zrhtUtKJWKTlb4opEuXIOpWtDItwzk12jit_nMzkxAqFEJFQqjiJfg0e-W8ofe4b_JyJ6aq3ekX1Uwv3947-h6eDA6G-9X-7mhvGZ4GAtiQyFmB3vTPX7eKR5upftcqFIPjh9bhG6v0Cjc |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9VAEJ4gJkQPqE-JiMoe9GKyod3ddlsSYwz4ABFiokRuZX-Gl2AfyiNE_zP_O2e27VMu3Lh2p22yM7vfzuzMNwCvjEdcKKi5iwuRK68ir2LQPMSi9MT_bVJR2MFhuXukPh4XxwvwZ6iFobTKYU9MG7WfOoqRbxCjdlaLrNyIfVbE5-3xu_MfnBpI0UXr0E2js5D98OsKvbeLt3vbqOrXQow_fN3a5X2DAe6EFjMu6tKr0ijjtDLKytxmWhRWBlfHzMRo84DwZ2yFOObyqGJBvZqVdFJaqZ2R-N07cFdLXZPfV4135iCA5_aUPYn-F6cEzuFCtavaU7rmlAFS4BLj-XVIvI4ICebGD2G5P5-y951BPYKF0I5gaUiPH8GDoQ0E63eFEdz_j9PwMZymaBaOniKIUa07o1Av2-pS4s-oUot9CTMUMa1nfZ0CiaVilE12MGkn3ye_05MpegbsWwreBs_oz0QVPm2T7BM4upXZXoHFdtqGp8DQyfN1VfioLXp4ItogayNyV9axqlQoViEbZrRxPdc5tdw4a_6xNJMSGlRCQ0po8lV4M3_lvCP6uEl4bVBT06_5i2Zuoc9uHF2HJbTc5tPe4f4a3EtMsCmi8xwWZz8vwws848zsy2RNDE5u23z_AlQkDQc |
| 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=Group+Scheduling+with+Controllable+Setup+and+Processing+Times%3A+Minimizing+Total+Weighted+Completion+Time&rft.jtitle=Annals+of+operations+research&rft.au=Ng%2C+C.+T.&rft.au=Cheng%2C+T.+C.+Edwin&rft.au=Janiak%2C+Adam&rft.au=Kovalyov%2C+Mikhail+Y.&rft.date=2005-01-01&rft.issn=0254-5330&rft.eissn=1572-9338&rft.volume=133&rft.issue=1-4&rft.spage=163&rft.epage=174&rft_id=info:doi/10.1007%2Fs10479-004-5030-1&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10479_004_5030_1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0254-5330&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0254-5330&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0254-5330&client=summon |