A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint
This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cann...
Saved in:
| Published in | The Journal of the Operational Research Society Vol. 66; no. 9; pp. 1542 - 1554 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
London
Taylor & Francis
01.09.2015
Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported. |
|---|---|
| AbstractList | This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing total tardiness. After processing a given number of jobs, each machine requires a preventive maintenance task, during which the machine cannot process jobs. We present dominance properties and lower bounds, and develop a branch and bound algorithm using these properties and lower bounds as well as an upper bound obtained from a heuristic algorithm. Performance of the algorithm is evaluated through a series of computational experiments on randomly generated instances and results are reported. |
| Author | Lee, Ju-Yong Kim, Yeong-Dae |
| Author_xml | – sequence: 1 givenname: Ju-Yong surname: Lee fullname: Lee, Ju-Yong organization: Korea Advanced Institute of Science and Technology (KAIST) – sequence: 2 givenname: Yeong-Dae surname: Kim fullname: Kim, Yeong-Dae email: ydkim@kaist.ac.kr organization: Korea Advanced Institute of Science and Technology (KAIST) |
| BookMark | eNp1kUtr3DAUhUVJIJOkyywLgq49kWRbtpch9AWBbtq1uHp4RkaWppKmw_TH9LdGxm0ppdlIgvude8_VuUYXPniD0B0lW0ra7n4KMW0Zoc2WMvYKbWjT8WqoOblAG0I5qVresyt0ndJECBkIHTbo5wOWEbzaY_Aay3AsJ7hdiDbvZ5wDnq23s_1hyjuDwxmitt6khMOIpyATth4DzqeArTY-WwWuOkAE54yrZlD7QuOk9kYfnfU7fIhBOjPjUxlQhL8J-A7WgbTO5jNWwaccwfp8iy5HcMm8_nXfoK_v3315_Fg9ff7w6fHhqVIN4bmSIHWvWas4NKbXinVDN7BxhLE1So4114ZxqUpN6aGvB7os3zLKe1CDIlDfoLdr32Lv29GkLKZwjL6MFLQrn9U1vGaFqldKxZBSNKNQNkO2wS9unaBELEGIJQixBCFKEEVV_aM6RDtDPL_Ib1c-Fc7vTPzLywuCN6tgSjnEP91Z05K2-C71fq1bP4Y4wylEp0WGswtxXMK3SdT_b_0MzjW99g |
| CODEN | OPRQAK |
| CitedBy_id | crossref_primary_10_1007_s10489_020_02027_1 crossref_primary_10_1109_ACCESS_2020_3041747 crossref_primary_10_1002_tee_22842 crossref_primary_10_1108_JM2_09_2023_0198 crossref_primary_10_1002_tee_22625 crossref_primary_10_1080_00207543_2019_1661539 crossref_primary_10_1080_01605682_2017_1415645 crossref_primary_10_1051_ro_2019088 crossref_primary_10_1016_j_promfg_2020_01_147 crossref_primary_10_1051_ro_2022191 crossref_primary_10_1016_j_engappai_2024_108572 crossref_primary_10_1155_2018_8073648 crossref_primary_10_3390_math10071200 crossref_primary_10_7735_ksmte_2024_33_5_214 crossref_primary_10_1016_j_ejor_2015_07_001 crossref_primary_10_1016_j_cie_2020_106320 crossref_primary_10_1016_j_eswa_2019_01_002 crossref_primary_10_1016_j_jmsy_2019_01_006 crossref_primary_10_1080_00207543_2021_1910746 |
| Cites_doi | 10.1016/0377-2217(94)00029-C 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 10.1016/j.ejor.2003.12.025 10.1057/palgrave.jors.2600791 10.1016/0166-218X(90)90055-H 10.1016/S0167-5060(08)70356-X 10.1016/S0377-2217(03)00232-7 10.1016/j.ejor.2003.08.034 10.1016/S0305-0548(02)00074-6 10.1002/nav.20324 10.1057/palgrave.jors.2602209 10.1016/j.cor.2011.11.002 10.1002/1520-6750(199010)37:5<661::AID-NAV3220370506>3.0.CO;2-3 10.1007/s00170-006-0524-4 10.1016/S0925-5273(98)00034-6 10.1007/BF00121681 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L 10.1016/S0925-5273(01)00175-X 10.1016/j.omega.2008.01.001 10.1017/S0269964800002138 10.1057/palgrave.jors.2602043 10.1016/j.amc.2009.11.040 10.1002/jos.68 10.1057/palgrave.jors.2601998 10.1016/j.dam.2004.12.003 10.1016/j.omega.2006.04.006 10.1002/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E 10.1016/S0167-5060(08)70743-X 10.1080/00207540010011054 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I 10.7232/IEIF.2012.25.1.127 10.1016/j.ejor.2005.09.038 10.1007/BF00288977 10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D 10.1287/opre.35.3.450 10.1002/nav.10045 10.1287/moor.15.3.483 10.1016/j.ejor.2008.07.005 10.1016/j.ejor.2008.03.043 10.1287/opre.33.2.363 10.1016/0925-5273(94)90026-4 10.1017/S0269964800000619 10.1057/jors.2010.143 10.1016/j.cor.2006.08.015 10.1016/j.ijpe.2007.10.006 |
| ContentType | Journal Article |
| Copyright | Copyright © 2015, Operational Research Society Ltd. 2015 Copyright © 2015 Operational Research Society Ltd Operational Research Society Ltd. 2015 |
| Copyright_xml | – notice: Copyright © 2015, Operational Research Society Ltd. 2015 – notice: Copyright © 2015 Operational Research Society Ltd – notice: Operational Research Society Ltd. 2015 |
| DBID | AAYXX CITATION 3V. 7RQ 7WY 7WZ 7X7 7XB 87Z 88E 8AL 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L.0 L6V M0C M0N M0S M1P M2O M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U U9A |
| DOI | 10.1057/jors.2014.122 |
| DatabaseName | CrossRef ProQuest Central (Corporate) Career & Technical Education Database ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Medical Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection Hospital Premium Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Research Library Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Aerospace Collection ProQuest Central Essentials - QC ProQuest Central Business Premium Collection Technology Collection ProQuest One ProQuest Central Korea Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database (ProQuest) ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ABI/INFORM Professional Standard ProQuest Engineering Collection ABI/INFORM Global Computing Database Health & Medical Collection (Alumni) Medical Database Research Library Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing 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 ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Career and Technical Education ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ABI/INFORM Professional Standard ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: 8FG name: ProQuest Technology Collection url: https://search.proquest.com/technologycollection1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Computer Science Business |
| EISSN | 1476-9360 |
| EndPage | 1554 |
| ExternalDocumentID | 3763146041 10_1057_jors_2014_122 24505463 11944432 |
| Genre | Research Article Feature |
| GroupedDBID | -~X .DC 0BK 0R~ 29L 30N 3R3 3V. 4.4 5GY 7RQ 7WY 7X7 88E 8FE 8FG 8FI 8FJ 8FL 8G5 8R4 8R5 AAAZS AAIAL AAJMT AALDU AAMIU AAPUL AAQRR AAXLS AAYZH ABBHK ABJCF ABJNI ABKVW ABLIJ ABLJU ABLWH ABMNI ABPAQ ABPPZ ABUWG ABXSQ ABXUL ABXYU ABYYQ ACGFO ACHQT ACIWK ACNCT ACREN ACTIO ACXJH ADBBV ADEPB ADFRT ADGDI ADGTB ADMHG ADNFJ ADULT AEBJH AECXW AEISY AENEX AEUPB AEXYK AEYOC AFAIT AFKRA AFTQD AGAYW AGDLA AHAJD AHDZW AHSBF AJPNJ AJRNO AKBVH AKOOK ALIPV ALMA_UNASSIGNED_HOLDINGS ALQZU AMKLP AMTXH APTMU AQRUH AQSKT ARAPS ASPBG AVWKF AWYRJ AXYYD AZQEC BENPR BEZIV BGLVJ BKKNO BLEHA BPHCQ BVXVI CBXGM CCCUG CCKSF CCPQU CS3 CSNOR CYVLN DGEBU DU5 DWQXO EBS EJD F5P FEFRA FRNLG FYUFA GENNL GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUQSH HCIFZ HMCUK IPSME JAAYA JAV JBC JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPL JPPEU JSODD JST K60 K6V K6~ K7- KYCEM L6V M0C M0N M1P M2O M4Z M7S MS~ O9- P2P P62 PQBIZ PQBZA PQQKQ PROAC PSQYO PTHSS Q2X RNANH ROSJB RPC RSV RTWRZ SA0 SNX SOJ TBQAZ TDBHL TEN TFL TFT TFW TN5 TTHFI TUROJ U5U UKHRP VQA WH7 XSW ZGOLN ~02 AAGDL AAHIA ABAWQ ACHJO AFRVT AGKTX AIYEW ASMEE PHGZM PHGZT PJZUB PPXIY PQGLB PUEGO TASJS ADYSH PKN 1OL 3EH AARHV AAYOK AAYXX ABDPE ACTTO ADMLS ADUMR ADXEU AEHZU AEZBV AFBWG AFFNX AGVKY AGWUF AI. AKHJE AKMBP ALRRR AMPGV BGSSV CAG CITATION COF CYRSC DAOYK GUPYA HGD HVGLF H~9 IFELN LJTGL N8N NHB NUSFT PLIJB RNS TAJZE VH1 ZCG 7XB 8AL 8FK JQ2 K9. L.- L.0 MBDVC PKEHL PQEST PQUKI PRINS Q9U U9A |
| ID | FETCH-LOGICAL-c406t-babd8d25c6a4e8dc279792ffaf5ecbf36de26bc4e8cd98391901952168ac9c0a3 |
| IEDL.DBID | 7X7 |
| ISSN | 0160-5682 |
| IngestDate | Sat Aug 23 13:34:57 EDT 2025 Thu Apr 24 23:04:41 EDT 2025 Tue Jul 01 04:24:27 EDT 2025 Fri Feb 21 02:38:30 EST 2025 Sun Aug 31 12:00:19 EDT 2025 Wed Dec 25 09:00:34 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Keywords | scheduling branch and bound identical parallel machines total tardiness availability constraint |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c406t-babd8d25c6a4e8dc279792ffaf5ecbf36de26bc4e8cd98391901952168ac9c0a3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 1700074632 |
| PQPubID | 31386 |
| PageCount | 13 |
| ParticipantIDs | informaworld_taylorfrancis_310_1057_jors_2014_122 jstor_primary_24505463 crossref_citationtrail_10_1057_jors_2014_122 crossref_primary_10_1057_jors_2014_122 springer_journals_10_1057_jors_2014_122 proquest_journals_1700074632 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2015-09-01 |
| PublicationDateYYYYMMDD | 2015-09-01 |
| PublicationDate_xml | – month: 09 year: 2015 text: 2015-09-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: Abingdon |
| PublicationTitle | The Journal of the Operational Research Society |
| PublicationTitleAbbrev | J Oper Res Soc |
| PublicationYear | 2015 |
| Publisher | Taylor & Francis Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd |
| Publisher_xml | – name: Taylor & Francis – name: Palgrave Macmillan – name: Palgrave Macmillan UK – name: Taylor & Francis Ltd |
| References | Lee, Kim (CR31) 2012; 39 Chu (CR13) 1992; 39 Adiri, Frostig, Rinnooy-Kan (CR2) 1991; 38 Ho, Wong (CR21) 1995; 42 Koulamas (CR26) 1997; 44 Choi, Kim (CR12) 2001; 39 Chen (CR10) 2008; 36 Rachamadugu (CR43) 1987; 35 Yalaoui, Chu (CR49) 2002; 76 Lee (CR27) 1996; 9 Tanaka, Araki (CR46) 2008; 113 Frostig (CR18) 1991; 5 Lee, Park, Hur (CR30) 2012; 25 Ecker, Gupta (CR17) 2005; 164 Hong, Park, Lie (CR22) 2010; 36 Lee, Liman (CR29) 1993; 41 Du, Leung (CR16) 1990; 15 Levin, Mosheiov, Sarig (CR34) 2009; 56 Lin, Liao (CR38) 2007; 33 Gharbi, Haouari (CR19) 2005; 148 Adiri, Bruno, Frostig, Rinnooy-Kan (CR1) 1989; 26 Hsu, Low, Su (CR23) 2010; 215 Chen (CR9) 2006; 57 Chen (CR11) 2009; 37 Kondakci, Azizoglu, Kirca (CR25) 1994; 36 Lenstra, Rinnooy-Kan, Brucker (CR33) 1977; 1 Potts, Van Wassenhove (CR41) 1985; 33 Qi, Chen, Tu (CR42) 1999; 50 Dell’Amico, Martello (CR15) 2001; 4 Birge, Frenk, Mittenthal, Rinnooy-Kan (CR7) 1990; 37 Mellouli, Sadfi, Chu, Kacem (CR39) 2009; 197 Liao, Chen, Lin (CR36) 2007; 58 Pinedo, Rammouz (CR40) 1988; 2 Wang, Wang, Liu (CR47) 2011; 62 Shim, Kim (CR45) 2007; 177 Graham, Lawler, Lenstra, Rinnooy-Kan (CR20) 1979; 5 Xu, Sun, Li (CR48) 2008; 35 Das, Lashkari, Sengupta (CR14) 2008; 7 Akturk, Ghosh, Gunes (CR3) 2003; 50 Liao, Chen (CR35) 2003; 30 Azizoglu, Kirca (CR5) 1998; 55 Lee, Chen (CR28) 2000; 47 Liao, Shyur, Lin (CR37) 2005; 160 Schaller (CR44) 2009; 197 Baker (CR6) 1974 Chen (CR8) 2006; 57 Lee, Lee (CR32) 2008; 34 Akturk, Ghosh, Gunes (CR4) 2004; 157 Kim (CR24) 1995; 85 CIT0030 CIT0031 Das K (CIT0014) 2008; 7 CIT0034 CIT0033 Hong SS (CIT0022) 2010; 36 CIT0036 CIT0035 CIT0038 CIT0037 Lee SH (CIT0032) 2008; 34 CIT0039 CIT0041 CIT0040 CIT0043 CIT0042 CIT0001 Baker KR (CIT0006) 1974 CIT0045 CIT0044 CIT0003 CIT0047 CIT0002 CIT0046 CIT0005 CIT0049 CIT0004 CIT0048 CIT0007 CIT0009 CIT0008 CIT0010 CIT0012 CIT0011 CIT0013 CIT0016 CIT0015 CIT0018 CIT0017 CIT0019 CIT0021 CIT0020 CIT0023 CIT0025 CIT0024 CIT0027 CIT0026 CIT0029 CIT0028 |
| References_xml | – volume: 85 start-page: 541 issue: 3 year: 1995 end-page: 555 ident: CR24 article-title: Minimizing total tardiness in permutation flowshops publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(94)00029-C – volume: 47 start-page: 145 issue: 2 year: 2000 end-page: 165 ident: CR28 article-title: Scheduling jobs and maintenance activities on parallel machines publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 – volume: 164 start-page: 627 issue: 3 year: 2005 end-page: 638 ident: CR17 article-title: Scheduling tasks on a flexible manufacturing machine to minimize tool change delays publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.12.025 – volume: 50 start-page: 1071 issue: 10 year: 1999 end-page: 1078 ident: CR42 article-title: Scheduling the maintenance on a single machine publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600791 – volume: 7 start-page: 114 issue: 2 year: 2008 end-page: 125 ident: CR14 article-title: Integrating machine reliability and preventive maintenance planning in manufacturing cell design publication-title: Industrial Engineering and Management Systems – volume: 41 start-page: 211 issue: 3 year: 1993 end-page: 222 ident: CR29 article-title: Capacitated two-parallel machines scheduling to minimize sum of job completion times publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(90)90055-H – volume: 5 start-page: 287 year: 1979 end-page: 326 ident: CR20 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 – volume: 157 start-page: 784 issue: 3 year: 2004 end-page: 790 ident: CR4 article-title: Scheduling with tool changes to minimize total completion time: Basic results and SPT performance publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00232-7 – year: 1974 ident: CR6 publication-title: Introduction to Sequencing and Scheduling – volume: 160 start-page: 445 issue: 2 year: 2005 end-page: 456 ident: CR37 article-title: Makespan minimization for two parallel machines with an availability constraint publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2003.08.034 – volume: 30 start-page: 1335 issue: 9 year: 2003 end-page: 1347 ident: CR35 article-title: Single-machine scheduling with periodic maintenance and nonresumable jobs publication-title: Computers and Operations Research doi: 10.1016/S0305-0548(02)00074-6 – volume: 56 start-page: 33 issue: 1 year: 2009 end-page: 41 ident: CR34 article-title: Scheduling a maintenance activity on parallel identical machines publication-title: Naval Research Logistics doi: 10.1002/nav.20324 – volume: 58 start-page: 938 issue: 7 year: 2007 end-page: 947 ident: CR36 article-title: Minimizing makespan for two parallel machines with job limit on each availability interval publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602209 – volume: 39 start-page: 2196 issue: 9 year: 2012 end-page: 2205 ident: CR31 article-title: Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance publication-title: Computers and Operations Research doi: 10.1016/j.cor.2011.11.002 – volume: 37 start-page: 661 issue: 5 year: 1990 end-page: 677 ident: CR7 article-title: Single-machine scheduling subject to stochastic breakdowns publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199010)37:5<661::AID-NAV3220370506>3.0.CO;2-3 – volume: 33 start-page: 1024 issue: 9–10 year: 2007 end-page: 1030 ident: CR38 article-title: Makespan minimization for two parallel machines with an unavailable period on each machine publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-006-0524-4 – volume: 55 start-page: 163 issue: 2 year: 1998 end-page: 168 ident: CR5 article-title: Tardiness minimization on parallel machines publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(98)00034-6 – volume: 9 start-page: 395 issue: 3–4 year: 1996 end-page: 416 ident: CR27 article-title: Machine scheduling with an availability constraint publication-title: Journal of Global Optimization doi: 10.1007/BF00121681 – volume: 34 start-page: 318 issue: 3 year: 2008 end-page: 327 ident: CR32 article-title: Heuristic algorithm for the single machine scheduling with periodic maintenance publication-title: Journal of the Korean Institute of Industrial Engineers – volume: 39 start-page: 265 issue: 2 year: 1992 end-page: 283 ident: CR13 article-title: A branch and bound algorithm to minimize total tardiness with different release dates publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L – volume: 76 start-page: 265 issue: 3 year: 2002 end-page: 279 ident: CR49 article-title: Parallel machine scheduling to minimize total tardiness publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(01)00175-X – volume: 37 start-page: 591 issue: 3 year: 2009 end-page: 599 ident: CR11 article-title: Minimizing number of tardy jobs on a single machine subject to periodic maintenance publication-title: Omega doi: 10.1016/j.omega.2008.01.001 – volume: 5 start-page: 349 issue: 3 year: 1991 end-page: 354 ident: CR18 article-title: A note on stochastic scheduling on a single machine subject to breakdown—the preemptive repeat model publication-title: Probability in the Engineering and Information Sciences doi: 10.1017/S0269964800002138 – volume: 57 start-page: 703 issue: 6 year: 2006 end-page: 710 ident: CR8 article-title: Single-machine scheduling with flexible and periodic maintenance publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2602043 – volume: 215 start-page: 3929 issue: 11 year: 2010 end-page: 3935 ident: CR23 article-title: A single-machine scheduling problem with maintenance activities to minimize makespan publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2009.11.040 – volume: 4 start-page: 123 issue: 3 year: 2001 end-page: 138 ident: CR15 article-title: Bounds for the cardinality constrained P∣∣C problem publication-title: Journal of Scheduling doi: 10.1002/jos.68 – volume: 57 start-page: 410 issue: 4 year: 2006 end-page: 415 ident: CR9 article-title: Minimizing total flow time in the single-machine scheduling problem with periodic maintenance publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601998 – volume: 148 start-page: 63 issue: 1 year: 2005 end-page: 87 ident: CR19 article-title: Optimal parallel machines scheduling with availability constraints publication-title: Discrete Applied Mathematics doi: 10.1016/j.dam.2004.12.003 – volume: 36 start-page: 888 issue: 5 year: 2008 end-page: 894 ident: CR10 article-title: Optimization models for the tool change scheduling problem publication-title: Omega doi: 10.1016/j.omega.2006.04.006 – volume: 44 start-page: 109 issue: 1 year: 1997 end-page: 125 ident: CR26 article-title: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem publication-title: Naval Research Logistics doi: 10.1002/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E – volume: 1 start-page: 343 year: 1977 end-page: 362 ident: CR33 article-title: Complexity of machine scheduling problems publication-title: Annals of Discrete Mathematics doi: 10.1016/S0167-5060(08)70743-X – volume: 39 start-page: 907 issue: 5 year: 2001 end-page: 921 ident: CR12 article-title: Tool replacement policies for a machining center producing multiple types of products with distinct due dates publication-title: International Journal of Production Research doi: 10.1080/00207540010011054 – volume: 38 start-page: 261 issue: 2 year: 1991 end-page: 271 ident: CR2 article-title: Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I – volume: 25 start-page: 127 issue: 1 year: 2012 end-page: 133 ident: CR30 article-title: A preventive maintenance scheduling model of the cluster tool publication-title: IE Interfaces doi: 10.7232/IEIF.2012.25.1.127 – volume: 177 start-page: 135 issue: 1 year: 2007 end-page: 146 ident: CR45 article-title: Scheduling on parallel identical machines to minimize total tardiness publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.09.038 – volume: 26 start-page: 679 issue: 7 year: 1989 end-page: 696 ident: CR1 article-title: Single machine flow-time scheduling with a single breakdown publication-title: Acta Informatica doi: 10.1007/BF00288977 – volume: 42 start-page: 935 issue: 6 year: 1995 end-page: 948 ident: CR21 article-title: Makespan minimization for parallel identical processors publication-title: Naval Research Logistics doi: 10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D – volume: 35 start-page: 450 issue: 3 year: 1987 end-page: 452 ident: CR43 article-title: A note on the weighted tardiness problem publication-title: Operations Research doi: 10.1287/opre.35.3.450 – volume: 50 start-page: 15 issue: 1 year: 2003 end-page: 30 ident: CR3 article-title: Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance publication-title: Naval Research Logistics doi: 10.1002/nav.10045 – volume: 15 start-page: 483 issue: 3 year: 1990 end-page: 495 ident: CR16 article-title: Minimizing total tardiness on one machine is NP-hard publication-title: Mathematics of Operations Research doi: 10.1287/moor.15.3.483 – volume: 197 start-page: 422 issue: 1 year: 2009 end-page: 426 ident: CR44 article-title: Note on Shim and Kim’s lower bounds for scheduling on identical parallel machines to minimize total tardiness publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.07.005 – volume: 197 start-page: 1150 issue: 3 year: 2009 end-page: 1165 ident: CR39 article-title: Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2008.03.043 – volume: 33 start-page: 363 issue: 2 year: 1985 end-page: 377 ident: CR41 article-title: A branch and bound algorithm for the total weighted tardiness problem publication-title: Operations Research doi: 10.1287/opre.33.2.363 – volume: 36 start-page: 213 issue: 2 year: 1994 end-page: 219 ident: CR25 article-title: An efficient algorithm for the single machine tardiness problem publication-title: International Journal of Production Economics doi: 10.1016/0925-5273(94)90026-4 – volume: 2 start-page: 41 issue: 1 year: 1988 end-page: 49 ident: CR40 article-title: A note on stochastic scheduling on a single machine subject to breakdown and repair publication-title: Probability in the Engineering and Information Sciences doi: 10.1017/S0269964800000619 – volume: 62 start-page: 1898 issue: 10 year: 2011 end-page: 1902 ident: CR47 article-title: Parallel machines scheduling with a deteriorating maintenance activity publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2010.143 – volume: 35 start-page: 1344 issue: 4 year: 2008 end-page: 1349 ident: CR48 article-title: Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan publication-title: Computers and Operations Research doi: 10.1016/j.cor.2006.08.015 – volume: 36 start-page: 108 issue: 2 year: 2010 end-page: 116 ident: CR22 article-title: Optimal preventive maintenance policy with cost-dependent improvement factor publication-title: Journal of the Korean Institute of Industrial Engineers – volume: 113 start-page: 446 issue: 1 year: 2008 end-page: 458 ident: CR46 article-title: A branch-and-bound algorithm with Lagrangian relaxation to minimize total tardiness on identical parallel machines publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2007.10.006 – volume-title: Introduction to Sequencing and Scheduling year: 1974 ident: CIT0006 – ident: CIT0011 doi: 10.1016/j.omega.2008.01.001 – ident: CIT0008 doi: 10.1057/palgrave.jors.2602043 – ident: CIT0021 doi: 10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D – ident: CIT0002 doi: 10.1002/1520-6750(199104)38:2<261::AID-NAV3220380210>3.0.CO;2-I – ident: CIT0016 doi: 10.1287/moor.15.3.483 – ident: CIT0024 doi: 10.1016/0377-2217(94)00029-C – ident: CIT0031 doi: 10.1016/j.cor.2011.11.002 – ident: CIT0044 doi: 10.1016/j.ejor.2008.07.005 – ident: CIT0034 doi: 10.1002/nav.20324 – ident: CIT0017 doi: 10.1016/j.ejor.2003.12.025 – ident: CIT0045 doi: 10.1016/j.ejor.2005.09.038 – ident: CIT0007 doi: 10.1002/1520-6750(199010)37:5<661::AID-NAV3220370506>3.0.CO;2-3 – ident: CIT0038 doi: 10.1007/s00170-006-0524-4 – volume: 7 start-page: 114 issue: 2 year: 2008 ident: CIT0014 publication-title: Industrial Engineering and Management Systems – ident: CIT0005 doi: 10.1016/S0925-5273(98)00034-6 – ident: CIT0018 doi: 10.1017/S0269964800002138 – ident: CIT0009 doi: 10.1057/palgrave.jors.2601998 – ident: CIT0033 doi: 10.1016/S0167-5060(08)70743-X – volume: 36 start-page: 108 issue: 2 year: 2010 ident: CIT0022 publication-title: Journal of the Korean Institute of Industrial Engineers – ident: CIT0047 doi: 10.1057/jors.2010.143 – ident: CIT0029 doi: 10.1016/0166-218X(90)90055-H – ident: CIT0020 doi: 10.1016/S0167-5060(08)70356-X – volume: 34 start-page: 318 issue: 3 year: 2008 ident: CIT0032 publication-title: Journal of the Korean Institute of Industrial Engineers – ident: CIT0012 doi: 10.1080/00207540010011054 – ident: CIT0019 doi: 10.1016/j.dam.2004.12.003 – ident: CIT0027 doi: 10.1007/BF00121681 – ident: CIT0040 doi: 10.1017/S0269964800000619 – ident: CIT0046 doi: 10.1016/j.ijpe.2007.10.006 – ident: CIT0042 doi: 10.1057/palgrave.jors.2600791 – ident: CIT0004 doi: 10.1016/S0377-2217(03)00232-7 – ident: CIT0025 doi: 10.1016/0925-5273(94)90026-4 – ident: CIT0041 doi: 10.1287/opre.33.2.363 – ident: CIT0043 doi: 10.1287/opre.35.3.450 – ident: CIT0036 doi: 10.1057/palgrave.jors.2602209 – ident: CIT0028 doi: 10.1002/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3 – ident: CIT0035 doi: 10.1016/S0305-0548(02)00074-6 – ident: CIT0015 doi: 10.1002/jos.68 – ident: CIT0001 doi: 10.1007/BF00288977 – ident: CIT0010 doi: 10.1016/j.omega.2006.04.006 – ident: CIT0037 doi: 10.1016/j.ejor.2003.08.034 – ident: CIT0003 doi: 10.1002/nav.10045 – ident: CIT0013 doi: 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L – ident: CIT0023 doi: 10.1016/j.amc.2009.11.040 – ident: CIT0030 doi: 10.7232/IEIF.2012.25.1.127 – ident: CIT0026 doi: 10.1002/(SICI)1520-6750(199702)44:1<109::AID-NAV7>3.0.CO;2-E – ident: CIT0049 doi: 10.1016/S0925-5273(01)00175-X – ident: CIT0048 doi: 10.1016/j.cor.2006.08.015 – ident: CIT0039 doi: 10.1016/j.ejor.2008.03.043 |
| SSID | ssj0009019 |
| Score | 2.2294173 |
| Snippet | This research focuses on the problem of scheduling jobs on two identical parallel machines that are not continuously available with the objective of minimizing... |
| SourceID | proquest crossref springer jstor informaworld |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 1542 |
| SubjectTerms | Algorithms availability constraint Branch & bound algorithms branch and bound Breakdowns Business and Management General Paper General Papers Heuristic identical parallel machines Job shops Linear programming Management Operations research Operations Research/Decision Theory Preventive maintenance Production scheduling Scheduling Studies total tardiness |
| Title | A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint |
| URI | https://www.tandfonline.com/doi/abs/10.1057/jors.2014.122 https://www.jstor.org/stable/24505463 https://link.springer.com/article/10.1057/jors.2014.122 https://www.proquest.com/docview/1700074632 |
| Volume | 66 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1Lb9QwEB5BKyE4AF2oWCjVHBAPCbe7ztMnVFCXikOFEJX2FtmOTbfKJqUbQPBj-K3MZJ12F1EuURS_oszY_mKPvw_gmfOWvDZSIimdEnEmtVDKeWGi2NPsW5bUpzja4jg9Ook_TJNpWHBbhLDKfkzsBuqysbxGvs88cqyNEck3518Fq0bx7mqQ0LgJm0xdxiFd2TS7It0ddcIeTKImkjSXgWOTIMr-WXPBZN3jeG8s5dqctMZY2kcpruHPv7ZMu5loch_uBgiJB0ubb8ENVw_gVh_BPoB7vVIDho47gDsrtIMD2ArPF_gysE6_egC_D9CwyMYp6rpEw2pLqKsv9Ana0zm2DTIJyXz2y9E9AXZs2bW4QWw8njVmgbMaNbY_Gpx1h3_J-IKJxavKVWLexWw6pH9pmtv4CDwGKRvklWAq2OfQ3_WsWpKH_0TL6JVFLNqHcDI5_PzuSATxBmEJI7TCaFPmpUxsqmOXl1ZmKlPSe-0TZ42P0tLJ1FhKs6UilMbARBGWSHNtlR3paBs26qZ2jwAj7yLNG4YjZWJlJVVIuCtl9BdJnWdDeN2br7CB2ZzfrSq6HfYkK9jaBVu7IGsP4fll9vMlpcd1GcervlC03RqKXwqeFNE1ZbY7h7msWcaEMclth7DTe1ARholFceXUQ3jRe9VK8r9aePz_ip7AbcqZLMPgdmCjvfjmnhJuas1u1znomk_e78Lm28Pjj5_-ALFsHBk |
| linkProvider | ProQuest |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwEB6VIkE5AF2oWCgwB16VMN11nj4gVAHLlpaeWqk34zhOu1V2U7qBqvwYfgK_kZk82l1EufUWJX4kmRnP2B5_H8Azl1nSWk-JIHVK-JE0QimXicTzM_K-aUo2xdkWO-Fwz_-8H-wvwO_2LAynVbZjYjVQp4XlNfJ1xpFjbgxPvjv-Jpg1indXWwqNWi223NkpTdmmbzc_kHyfSzn4uPt-KBpWAWHJeZUiMUkapzKwofFdnFoZqUjJLDNZ4GySeWHqZJhYemZTReEDe0xFTi6MjVW2Zzxq9xpc9-kD2aLiwacLkN9eRSTCoG0iCGPZYHpSSLR-VJwwOHjff9OXcs4HziGktlmRc_HuX1u0lecb3IXbTciKG7WOLcOCm3TgRpsx34E7LTMENgNFB27NwBx2YLm5P8VXDcr12j34tYEJk3ocopmkmDC7E5r8gH55eTjGskAGPRmPfjq6pgkClqzK3CEWGR4VyRRHEzRYnhY4qg4bk7IJBjLPc5eLcZUj6pDm7uRL-cg9NtQ5yCvPVLEtYX6YUV6DlZ-h5WiZSTPK-7B3JWJdgcVJMXEPAL3MeYY3KHsq8ZWV1CDFeSFHm540cdSF1634tG2Q1Pndcl3t6AeRZmlrlrYmaXfhxXnx4xpC5LKC_Vld0GW1ZpPVBCvau6TOSqUw5y1Ln2JaMpMurLYapJthaaovjKgLL1utmnn8rx4e_r-hp3BzuPtlW29v7mw9giWqFdQpeKuwWJ58d48pZiuTJ5WhIHy9asv8A9W7WEU |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxEB6VIlX0ADRQkVJgDjwlTBLv0weEKkrUUlRxoFJuW6_Xpqk22dIsVOXH8EP4dczso00Q5dZblLW9UeYbz9gefx_AU-sModZTIsisEn4ktVDKOpF6vqPom2XkU1xtsR_uHPgfR8FoCX63d2G4rLKdE6uJOisM75H3mEeOtTE82XNNWcTn7eG7k2-CFaT4pLWV06ghsmfPz2j5Nnu7u022fibl8MOX9zuiURgQhgJZKVKdZnEmAxNq38aZkZGKlHROu8Ca1HlhZmWYGnpmMkWpBEdPRQEvjLVRpq89GvcG3Iy8YMA-Fo2iS8LffiUqwgRuIghj2fB7UnrUOy5OmSh84L8ZSLkQDxfYUtsKyYXc96_j2ioKDu_C7SZ9xa0ab2uwZKcdWGmr5ztwp1WJwGbS6MDqHOVhB9aa72f4smG8fnUPfm1hygIfR6inGaas9IQ6_0p_eXk0wbJAJkCZjH9a-kyLBSwZ1vxCLBweF-kMx1PUWJ4VOK4uHhPwBJOa57nNxaSqF7VI63iKq3z9HhsZHeRdaOrYttA_9DivicvP0XDmzAIa5X04uBazrsPytJjaB4Ces57mw8q-Sn1lJA1IOV_ImacndRx14XVrvsQ0rOr82_KkOt0PooStnbC1E7J2F55fND-p6USuajiYx0JSVvs3rhZbSbwr-qxXgLkYWfqU35LLdGGzRVDSTFGz5NKhuvCiRdXc43-9YeP_Az2BFfLJ5NPu_t5DuEWdgroabxOWy9Pv9hGlb2X6uPIThMPrdsw_h4dccg |
| 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=A+branch+and+bound+algorithm+to+minimize+total+tardiness+of+jobs+in+a+two+identical-parallel-machine+scheduling+problem+with+a+machine+availability+constraint&rft.jtitle=The+Journal+of+the+Operational+Research+Society&rft.au=Lee%2C+Ju-Yong&rft.au=Kim%2C+Yeong-Dae&rft.date=2015-09-01&rft.pub=Taylor+%26+Francis&rft.issn=0160-5682&rft.eissn=1476-9360&rft.volume=66&rft.issue=9&rft.spage=1542&rft.epage=1554&rft_id=info:doi/10.1057%2Fjors.2014.122&rft.externalDocID=11944432 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0160-5682&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0160-5682&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0160-5682&client=summon |