Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs
•Examine a two-machine flowshop scheduling problem with deteriorating jobs.•Minimize the total completion time subject to minimum makespan.•Propose a mixed integer programming and branch-and-bound algorithm for the problem.•Discuss dominant conditions and several polynomial-time solvable special cas...
Uložené v:
| Vydané v: | European journal of operational research Ročník 234; číslo 3; s. 650 - 657 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Amsterdam
Elsevier B.V
01.05.2014
Elsevier Sequoia S.A |
| 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 | •Examine a two-machine flowshop scheduling problem with deteriorating jobs.•Minimize the total completion time subject to minimum makespan.•Propose a mixed integer programming and branch-and-bound algorithm for the problem.•Discuss dominant conditions and several polynomial-time solvable special cases.•Examine the effectiveness and efficiency of the proposed algorithms.
We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer programming model, and develop two pairwise interchange algorithms and a branch-and-bound procedure to solve the problem while using several dominance conditions to limit the size of the search tree. Several polynomial-time solvable special cases are discussed. Finally, numerical studies are performed to examine the effectiveness and the efficiency of the proposed algorithms. |
|---|---|
| AbstractList | •Examine a two-machine flowshop scheduling problem with deteriorating jobs.•Minimize the total completion time subject to minimum makespan.•Propose a mixed integer programming and branch-and-bound algorithm for the problem.•Discuss dominant conditions and several polynomial-time solvable special cases.•Examine the effectiveness and efficiency of the proposed algorithms.
We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer programming model, and develop two pairwise interchange algorithms and a branch-and-bound procedure to solve the problem while using several dominance conditions to limit the size of the search tree. Several polynomial-time solvable special cases are discussed. Finally, numerical studies are performed to examine the effectiveness and the efficiency of the proposed algorithms. We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer programming model, and develop two pairwise interchange algorithms and a branch-and-bound procedure to solve the problem while using several dominance conditions to limit the size of the search tree. Several polynomial-time solvable special cases are discussed. Finally, numerical studies are performed to examine the effectiveness and the efficiency of the proposed algorithms. We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of their starting time. The objective is to minimize the total completion time subject to minimum makespan. We propose a mixed integer programming model, and develop two pairwise interchange algorithms and a branch-and-bound procedure to solve the problem while using several dominance conditions to limit the size of the search tree. Several polynomial-time solvable special cases are discussed. Finally, numerical studies are performed to examine the effectiveness and the efficiency of the proposed algorithms. [PUBLICATION ABSTRACT] |
| Author | Tadikamalla, Pandu R. Zhang, Shaqing Shang, Jennifer Cheng, Mingbao |
| Author_xml | – sequence: 1 givenname: Mingbao surname: Cheng fullname: Cheng, Mingbao email: chengmb99@hotmail.com organization: School of Management, Guangdong University of Technology, Guangzhou, Guangdong Province 510520, PR China – sequence: 2 givenname: Pandu R. surname: Tadikamalla fullname: Tadikamalla, Pandu R. organization: Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, PA 15260, United States – sequence: 3 givenname: Jennifer surname: Shang fullname: Shang, Jennifer organization: Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, PA 15260, United States – sequence: 4 givenname: Shaqing surname: Zhang fullname: Zhang, Shaqing organization: School of Management, Guangdong University of Technology, Guangzhou, Guangdong Province 510520, PR China |
| BookMark | eNp9kT1v3SAUhlGVSr1J-wc6IXXJYocD_pS6JFHbRIqUpZ0RxocaywYXuLlKf325vZkyZGLgfc7Xc07OnHdIyGdgJTBoruYSZx9KzkCUrC-ZEO_IDrqWF03XsDOyY6JtC86h_UDOY5wZY1BDvSOHG6uDTRisopPFoIKerFYL9Vuyq_2rkvWOekPTwReryp8OqVn8gcbJbzTqCcf9Yt1vugU_LLjSg00TzSwWI27oRnSJjnjs4EOulpOzH-JH8t6oJeKnl_eC_Pr-7eftXfHw-OP-9vqh0KLnqRgMcqygqUcYTQe8yxtWfQv90HMtOB_MgDhwZmpUFVPCGFUbBYiM6VrjKC7I5aluHu_PHmOSq40al0U59PsooRas75u2hhz98io6-31weTqZe0LF2wq6nOKnlA4-xoBGbsGuKjxLYPLoQs7y6EIeXUjWy-wiQ90rSNv0_7QpKLu8jX49oZiv9JQNyagturybDaiTHL19C_8HKASqdg |
| CODEN | EJORDT |
| CitedBy_id | crossref_primary_10_1177_1687814017698887 crossref_primary_10_1007_s11241_020_09352_1 crossref_primary_10_1080_0305215X_2024_2302909 crossref_primary_10_3233_JIFS_220174 crossref_primary_10_1057_jors_2014_58 crossref_primary_10_1080_0305215X_2018_1519558 crossref_primary_10_1016_j_eswa_2022_118068 crossref_primary_10_1016_j_cie_2021_107907 crossref_primary_10_1016_j_ejor_2025_05_024 crossref_primary_10_1109_ACCESS_2019_2911028 crossref_primary_10_1016_j_cie_2019_05_007 crossref_primary_10_7232_JKIIE_2021_47_1_034 crossref_primary_10_1016_j_ejor_2017_05_021 crossref_primary_10_1007_s10951_019_00630_w crossref_primary_10_1016_j_cor_2018_06_009 crossref_primary_10_1155_2016_5958640 crossref_primary_10_3390_machines11020292 crossref_primary_10_1109_TSMC_2019_2907575 crossref_primary_10_1177_0954405417691553 crossref_primary_10_1007_s11590_018_1322_2 crossref_primary_10_1080_21681015_2014_908501 crossref_primary_10_1016_j_asoc_2017_12_009 crossref_primary_10_1016_j_ejor_2014_09_043 crossref_primary_10_1016_j_eswa_2020_113556 crossref_primary_10_1080_17517575_2015_1078913 crossref_primary_10_1080_0305215X_2024_2425724 crossref_primary_10_1007_s10845_018_1425_8 crossref_primary_10_1016_j_ejor_2015_02_037 crossref_primary_10_1142_S0217595915500499 crossref_primary_10_1080_00207543_2022_2049911 crossref_primary_10_1016_j_cor_2019_06_015 crossref_primary_10_1016_j_suscom_2022_100680 crossref_primary_10_1109_ACCESS_2021_3112742 crossref_primary_10_1007_s10845_017_1385_4 crossref_primary_10_1109_TCYB_2019_2943606 |
| Cites_doi | 10.1016/S0377-2217(03)00192-9 10.1016/j.ejor.2006.10.043 10.1016/j.cor.2004.07.016 10.1016/S0377-2217(02)00909-8 10.1016/S0166-218X(00)00385-1 10.1016/S0305-0548(02)00021-7 10.1057/jors.1989.58 10.1016/j.ejor.2009.06.031 10.1007/s00170-006-0646-8 10.1023/A:1018913902852 10.1016/j.amc.2005.11.162 10.1016/0377-2217(95)00275-8 10.1057/palgrave.jors.2601959 10.1016/j.ejor.2008.12.014 10.1007/s00170-007-0931-1 10.1016/0925-5273(93)90024-F 10.1016/0377-2217(93)E0140-S 10.1016/j.ejor.2004.07.011 10.1016/0305-0548(94)90080-9 10.1016/j.eswa.2010.11.022 10.1016/S0925-5273(00)00039-6 10.1016/j.amc.2010.11.037 10.1057/jors.2010.171 10.1016/j.ijpe.2005.11.005 10.1016/0305-0548(94)E0007-T 10.1287/moor.1.2.117 10.1007/s00170-008-1770-4 10.1057/palgrave.jors.2600740 |
| ContentType | Journal Article |
| Copyright | 2013 Elsevier B.V. Copyright Elsevier Sequoia S.A. May 1, 2014 |
| Copyright_xml | – notice: 2013 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. May 1, 2014 |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D 7TA JG9 |
| DOI | 10.1016/j.ejor.2013.09.033 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Materials Business File Materials Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Materials Research Database Materials Business File |
| DatabaseTitleList | Materials Research Database Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 657 |
| ExternalDocumentID | 3190282941 10_1016_j_ejor_2013_09_033 S0377221713007881 |
| Genre | Feature |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 4.4 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACIWK ACNCT ACRLP ACZNC ADBBV ADEZE ADGUI AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR AXJTR BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ RXW SCC SDF SDG SDP SDS SES SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U XPP ZMT ~02 ~G- 1OL 29G 41~ 9DU AAAKG AALRI AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADIYS ADJOM ADMUD ADNMO ADXHL AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB HVGLF HZ~ R2- SEW VH1 WUQ ~HD 7SC 7TB 8FD AFXIZ AGCQF AGRNS FR3 JQ2 L7M L~C L~D SSH 7TA JG9 |
| ID | FETCH-LOGICAL-c392t-bfe2e4165d1df812820149719b92c322bfbeeb20f5ea40a3ffa5fa1ee00c5ced3 |
| ISICitedReferencesCount | 37 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000331419800007&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 | Sat Sep 27 18:09:33 EDT 2025 Fri Jul 25 05:51:55 EDT 2025 Sat Nov 29 07:22:04 EST 2025 Tue Nov 18 22:11:22 EST 2025 Fri Feb 23 02:32:26 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Deteriorating job Branch-and-bound Mixed integer programming Scheduling Hierarchical optimization |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c392t-bfe2e4165d1df812820149719b92c322bfbeeb20f5ea40a3ffa5fa1ee00c5ced3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| PQID | 1491427418 |
| PQPubID | 45678 |
| PageCount | 8 |
| ParticipantIDs | proquest_miscellaneous_1530996751 proquest_journals_1491427418 crossref_primary_10_1016_j_ejor_2013_09_033 crossref_citationtrail_10_1016_j_ejor_2013_09_033 elsevier_sciencedirect_doi_10_1016_j_ejor_2013_09_033 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-05-01 |
| PublicationDateYYYYMMDD | 2014-05-01 |
| PublicationDate_xml | – month: 05 year: 2014 text: 2014-05-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2014 |
| Publisher | Elsevier B.V Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Sequoia S.A |
| References | Gawiejnowicz, Lee, Lin, Wu (b0055) 2011; 62 Gawiejnowicz, Kurc, Pankowska (b0060) 2006; 33 Gupta, Venkata, Neppalli, Frank Werner (b0070) 2001; 69 Nagar, Haddock, Heragu (b0110) 1995; 81 Dugardin, Yalaoui, Amodeo (b0030) 2010; 203 Yang, Wang (b0165) 2011; 217 Cheng, Sun, He (b0015) 2007; 183 Gawiejnowicz (b0045) 2008 Eren, Gner (b0035) 2008; 36 Mosheiov (b0100) 1998; 36 Cheng, Ding, Lin (b0020) 2004; 152 Gawiejnowicz, Kononov (b0050) 2010; 200 Mosheiov (b0095) 1994; 21 Shiau, Lee, Wu, Chang (b0125) 2007; 34 Chen, C. L., & Vempati V. S. (1992). Multicriteria flow shop scheduling: minimizing total flow time and maximum completion time. Working paper, Department of Industrial Engineering, Mississippi State University. Wu, Lee (b0160) 2006; 103 Lee, Vairaktarakis (b0085) 1993 Chiang, Cheng, Fu (b0025) 2011; 38 T’kindt, Gupta, Billaut (b0130) 2002 Nepalli, Chen, Gupta (b0115) 1996; 95 Mosheiov (b0105) 2002; 117 Gupta, Ho, Van der Veen (b0065) 1999; 70 Wang, Xia (b0150) 2006; 57 Hoogeveen (b0080) 2005; 167 T’kindt, Gupta, Billaut (b0135) 2003; 30 Wilson (b0155) 1989; 40 Alidaee, Womer (b0005) 1999; 50 Lei (b0090) 2009; 43 Toktas, Azizoglu, Koksalan (b0140) 2004; 157 Wang, Ng, Cheng, Liu (b0145) 2006; 180 Rajendran (b0120) 1993; 29 Ho, Gupta (b0075) 1995; 22 Garey, Johnson, Sethi (b0040) 1976; 1 Garey (10.1016/j.ejor.2013.09.033_b0040) 1976; 1 Lee (10.1016/j.ejor.2013.09.033_b0085) 1993 Ho (10.1016/j.ejor.2013.09.033_b0075) 1995; 22 Gawiejnowicz (10.1016/j.ejor.2013.09.033_b0045) 2008 Yang (10.1016/j.ejor.2013.09.033_b0165) 2011; 217 Alidaee (10.1016/j.ejor.2013.09.033_b0005) 1999; 50 T’kindt (10.1016/j.ejor.2013.09.033_b0135) 2003; 30 Wang (10.1016/j.ejor.2013.09.033_b0150) 2006; 57 Wu (10.1016/j.ejor.2013.09.033_b0160) 2006; 103 Gupta (10.1016/j.ejor.2013.09.033_b0070) 2001; 69 Mosheiov (10.1016/j.ejor.2013.09.033_b0100) 1998; 36 Cheng (10.1016/j.ejor.2013.09.033_b0020) 2004; 152 T’kindt (10.1016/j.ejor.2013.09.033_b0130) 2002 Mosheiov (10.1016/j.ejor.2013.09.033_b0105) 2002; 117 Wang (10.1016/j.ejor.2013.09.033_b0145) 2006; 180 Mosheiov (10.1016/j.ejor.2013.09.033_b0095) 1994; 21 Lei (10.1016/j.ejor.2013.09.033_b0090) 2009; 43 Gawiejnowicz (10.1016/j.ejor.2013.09.033_b0050) 2010; 200 Cheng (10.1016/j.ejor.2013.09.033_b0015) 2007; 183 Wilson (10.1016/j.ejor.2013.09.033_b0155) 1989; 40 10.1016/j.ejor.2013.09.033_b0010 Gupta (10.1016/j.ejor.2013.09.033_b0065) 1999; 70 Nagar (10.1016/j.ejor.2013.09.033_b0110) 1995; 81 Nepalli (10.1016/j.ejor.2013.09.033_b0115) 1996; 95 Chiang (10.1016/j.ejor.2013.09.033_b0025) 2011; 38 Gawiejnowicz (10.1016/j.ejor.2013.09.033_b0055) 2011; 62 Hoogeveen (10.1016/j.ejor.2013.09.033_b0080) 2005; 167 Shiau (10.1016/j.ejor.2013.09.033_b0125) 2007; 34 Dugardin (10.1016/j.ejor.2013.09.033_b0030) 2010; 203 Gawiejnowicz (10.1016/j.ejor.2013.09.033_b0060) 2006; 33 Eren (10.1016/j.ejor.2013.09.033_b0035) 2008; 36 Rajendran (10.1016/j.ejor.2013.09.033_b0120) 1993; 29 Toktas (10.1016/j.ejor.2013.09.033_b0140) 2004; 157 |
| References_xml | – volume: 117 start-page: 195 year: 2002 end-page: 209 ident: b0105 article-title: Complexity analysis of job-shop scheduling with deteriorating jobs publication-title: Discrete Applied Mathematics – reference: Chen, C. L., & Vempati V. S. (1992). Multicriteria flow shop scheduling: minimizing total flow time and maximum completion time. Working paper, Department of Industrial Engineering, Mississippi State University. – volume: 95 start-page: 356 year: 1996 end-page: 373 ident: b0115 article-title: Genetic algorithms for the two-stage bicriteria flowshop problem publication-title: European Journal of Operational Research – volume: 183 start-page: 115 year: 2007 end-page: 124 ident: b0015 article-title: Flow shop scheduling problem with deteriorating jobs on no-idle dominant machines publication-title: European Journal of Operational Research – volume: 69 start-page: 323 year: 2001 end-page: 338 ident: b0070 article-title: Minimizing total flow time in a two-machine flowshop problem with minimum makespan publication-title: International Journal of Production Economics – volume: 217 start-page: 4819 year: 2011 end-page: 4826 ident: b0165 article-title: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration publication-title: Applied Mathematics and Computation – volume: 33 start-page: 746 year: 2006 end-page: 767 ident: b0060 article-title: Pareto and scalar bicriteria optimization in scheduling deteriorating jobs publication-title: Computers & Operations Research – volume: 203 start-page: 22 year: 2010 end-page: 31 ident: b0030 article-title: New multi-objective method to solve reentrant hybrid flow shop scheduling problem publication-title: European Journal of Operational Research – volume: 167 start-page: 592 year: 2005 end-page: 623 ident: b0080 article-title: Multicriteria scheduling publication-title: European Journal of Operational Research – volume: 38 start-page: 5986 year: 2011 end-page: 5999 ident: b0025 article-title: NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems publication-title: Expert Systems with Applications – volume: 200 start-page: 305 year: 2010 end-page: 308 ident: b0050 article-title: Complexity and approximability of scheduling resumable proportionally deteriorating jobs publication-title: Eureapean Journal of Operational Research – volume: 50 start-page: 711 year: 1999 end-page: 720 ident: b0005 article-title: Scheduling with time dependent processing times: Review and extensions publication-title: Journal of the Operational Research Society – volume: 22 start-page: 237 year: 1995 end-page: 246 ident: b0075 article-title: Flowshop scheduling with dominant machines publication-title: Computers & Operations Research – volume: 36 start-page: 1210 year: 2008 end-page: 1220 ident: b0035 article-title: The tricriteria flowshop scheduling problem publication-title: International Journal of Advanced Manufacturing Technology – volume: 1 start-page: 117 year: 1976 end-page: 129 ident: b0040 article-title: The complexity of flowshop and jobshop scheduling publication-title: Mathematics of Operations Research – volume: 62 start-page: 1983 year: 2011 end-page: 1991 ident: b0055 article-title: Single-machine scheduling of proportionally deteriorating jobs by two agents publication-title: Journal of the Operational Research Society – volume: 30 start-page: 505 year: 2003 end-page: 526 ident: b0135 article-title: Two-machine flowshop scheduling with a secondary criterion publication-title: Computers & Operations Research – volume: 40 start-page: 395 year: 1989 end-page: 399 ident: b0155 article-title: Alternative formulations of a flowshop scheduling problem publication-title: Journal of the Operational Research Society – volume: 157 start-page: 286 year: 2004 end-page: 295 ident: b0140 article-title: Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan publication-title: European Journal of Operational Research – start-page: 269 year: 1993 end-page: 298 ident: b0085 article-title: Complexity of single machine hierarchical scheduling: A survey publication-title: Complexity in numerical optimization – year: 2002 ident: b0130 article-title: Multicriteria scheduling – volume: 103 start-page: 572 year: 2006 end-page: 584 ident: b0160 article-title: Two-machine flow shop scheduling to minimize mean flow time under linear deterioration publication-title: International Journal of Production Economics – year: 2008 ident: b0045 article-title: Time-dependent scheduling – volume: 70 start-page: 127 year: 1999 end-page: 143 ident: b0065 article-title: Single machine hierarchical scheduling with customer orders and multiple job classes publication-title: Annals of Operations Research – volume: 152 start-page: 1 year: 2004 end-page: 13 ident: b0020 article-title: A concise survey of scheduling with time-dependent processing times publication-title: European Journal of Operational Research – volume: 180 start-page: 185 year: 2006 end-page: 193 ident: b0145 article-title: Minimizing total completion time in a two-machine flow shop with deteriorating jobs publication-title: Applied Mathematics and Computation – volume: 43 start-page: 926 year: 2009 end-page: 938 ident: b0090 article-title: Multi-objective production scheduling: A survey publication-title: International Journal of Advanced Manufacturing Technology – volume: 29 start-page: 65 year: 1993 end-page: 73 ident: b0120 article-title: Heuristic algorithm for scheduling in a flowshop to minimize total flow time publication-title: International Journal of Production Economics – volume: 36 start-page: 205 year: 1998 end-page: 214 ident: b0100 article-title: Multi-machine scheduling with linear deterioration publication-title: INFOR – volume: 34 start-page: 774 year: 2007 end-page: 782 ident: b0125 article-title: Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration publication-title: International Journal of Advanced Manufacturing Technology – volume: 21 start-page: 653 year: 1994 end-page: 659 ident: b0095 article-title: Scheduling jobs under simple linear deterioration publication-title: Computers & Operations Research – volume: 81 start-page: 88 year: 1995 end-page: 104 ident: b0110 article-title: Multiple and bicriteria scheduling: A literature survey publication-title: European Journal of Operational Research – volume: 57 start-page: 220 year: 2006 end-page: 226 ident: b0150 article-title: Flow shop scheduling problem with deteriorating jobs under dominating machines publication-title: Journal of the Operational Research Society – volume: 157 start-page: 286 year: 2004 ident: 10.1016/j.ejor.2013.09.033_b0140 article-title: Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(03)00192-9 – year: 2008 ident: 10.1016/j.ejor.2013.09.033_b0045 – volume: 183 start-page: 115 year: 2007 ident: 10.1016/j.ejor.2013.09.033_b0015 article-title: Flow shop scheduling problem with deteriorating jobs on no-idle dominant machines publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.10.043 – volume: 33 start-page: 746 year: 2006 ident: 10.1016/j.ejor.2013.09.033_b0060 article-title: Pareto and scalar bicriteria optimization in scheduling deteriorating jobs publication-title: Computers & Operations Research doi: 10.1016/j.cor.2004.07.016 – volume: 152 start-page: 1 year: 2004 ident: 10.1016/j.ejor.2013.09.033_b0020 article-title: A concise survey of scheduling with time-dependent processing times publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(02)00909-8 – volume: 117 start-page: 195 year: 2002 ident: 10.1016/j.ejor.2013.09.033_b0105 article-title: Complexity analysis of job-shop scheduling with deteriorating jobs publication-title: Discrete Applied Mathematics doi: 10.1016/S0166-218X(00)00385-1 – year: 2002 ident: 10.1016/j.ejor.2013.09.033_b0130 – volume: 30 start-page: 505 year: 2003 ident: 10.1016/j.ejor.2013.09.033_b0135 article-title: Two-machine flowshop scheduling with a secondary criterion publication-title: Computers & Operations Research doi: 10.1016/S0305-0548(02)00021-7 – volume: 40 start-page: 395 year: 1989 ident: 10.1016/j.ejor.2013.09.033_b0155 article-title: Alternative formulations of a flowshop scheduling problem publication-title: Journal of the Operational Research Society doi: 10.1057/jors.1989.58 – volume: 203 start-page: 22 year: 2010 ident: 10.1016/j.ejor.2013.09.033_b0030 article-title: New multi-objective method to solve reentrant hybrid flow shop scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2009.06.031 – ident: 10.1016/j.ejor.2013.09.033_b0010 – volume: 34 start-page: 774 year: 2007 ident: 10.1016/j.ejor.2013.09.033_b0125 article-title: Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-006-0646-8 – volume: 70 start-page: 127 year: 1999 ident: 10.1016/j.ejor.2013.09.033_b0065 article-title: Single machine hierarchical scheduling with customer orders and multiple job classes publication-title: Annals of Operations Research doi: 10.1023/A:1018913902852 – volume: 180 start-page: 185 year: 2006 ident: 10.1016/j.ejor.2013.09.033_b0145 article-title: Minimizing total completion time in a two-machine flow shop with deteriorating jobs publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2005.11.162 – volume: 95 start-page: 356 year: 1996 ident: 10.1016/j.ejor.2013.09.033_b0115 article-title: Genetic algorithms for the two-stage bicriteria flowshop problem publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(95)00275-8 – volume: 57 start-page: 220 year: 2006 ident: 10.1016/j.ejor.2013.09.033_b0150 article-title: Flow shop scheduling problem with deteriorating jobs under dominating machines publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2601959 – volume: 200 start-page: 305 year: 2010 ident: 10.1016/j.ejor.2013.09.033_b0050 article-title: Complexity and approximability of scheduling resumable proportionally deteriorating jobs publication-title: Eureapean Journal of Operational Research doi: 10.1016/j.ejor.2008.12.014 – volume: 36 start-page: 1210 year: 2008 ident: 10.1016/j.ejor.2013.09.033_b0035 article-title: The tricriteria flowshop scheduling problem publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-007-0931-1 – volume: 29 start-page: 65 year: 1993 ident: 10.1016/j.ejor.2013.09.033_b0120 article-title: Heuristic algorithm for scheduling in a flowshop to minimize total flow time publication-title: International Journal of Production Economics doi: 10.1016/0925-5273(93)90024-F – volume: 81 start-page: 88 year: 1995 ident: 10.1016/j.ejor.2013.09.033_b0110 article-title: Multiple and bicriteria scheduling: A literature survey publication-title: European Journal of Operational Research doi: 10.1016/0377-2217(93)E0140-S – volume: 167 start-page: 592 year: 2005 ident: 10.1016/j.ejor.2013.09.033_b0080 article-title: Multicriteria scheduling publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2004.07.011 – volume: 21 start-page: 653 year: 1994 ident: 10.1016/j.ejor.2013.09.033_b0095 article-title: Scheduling jobs under simple linear deterioration publication-title: Computers & Operations Research doi: 10.1016/0305-0548(94)90080-9 – start-page: 269 year: 1993 ident: 10.1016/j.ejor.2013.09.033_b0085 article-title: Complexity of single machine hierarchical scheduling: A survey – volume: 38 start-page: 5986 year: 2011 ident: 10.1016/j.ejor.2013.09.033_b0025 article-title: NNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2010.11.022 – volume: 69 start-page: 323 year: 2001 ident: 10.1016/j.ejor.2013.09.033_b0070 article-title: Minimizing total flow time in a two-machine flowshop problem with minimum makespan publication-title: International Journal of Production Economics doi: 10.1016/S0925-5273(00)00039-6 – volume: 36 start-page: 205 year: 1998 ident: 10.1016/j.ejor.2013.09.033_b0100 article-title: Multi-machine scheduling with linear deterioration publication-title: INFOR – volume: 217 start-page: 4819 year: 2011 ident: 10.1016/j.ejor.2013.09.033_b0165 article-title: Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2010.11.037 – volume: 62 start-page: 1983 year: 2011 ident: 10.1016/j.ejor.2013.09.033_b0055 article-title: Single-machine scheduling of proportionally deteriorating jobs by two agents publication-title: Journal of the Operational Research Society doi: 10.1057/jors.2010.171 – volume: 103 start-page: 572 year: 2006 ident: 10.1016/j.ejor.2013.09.033_b0160 article-title: Two-machine flow shop scheduling to minimize mean flow time under linear deterioration publication-title: International Journal of Production Economics doi: 10.1016/j.ijpe.2005.11.005 – volume: 22 start-page: 237 year: 1995 ident: 10.1016/j.ejor.2013.09.033_b0075 article-title: Flowshop scheduling with dominant machines publication-title: Computers & Operations Research doi: 10.1016/0305-0548(94)E0007-T – volume: 1 start-page: 117 year: 1976 ident: 10.1016/j.ejor.2013.09.033_b0040 article-title: The complexity of flowshop and jobshop scheduling publication-title: Mathematics of Operations Research doi: 10.1287/moor.1.2.117 – volume: 43 start-page: 926 year: 2009 ident: 10.1016/j.ejor.2013.09.033_b0090 article-title: Multi-objective production scheduling: A survey publication-title: International Journal of Advanced Manufacturing Technology doi: 10.1007/s00170-008-1770-4 – volume: 50 start-page: 711 year: 1999 ident: 10.1016/j.ejor.2013.09.033_b0005 article-title: Scheduling with time dependent processing times: Review and extensions publication-title: Journal of the Operational Research Society doi: 10.1057/palgrave.jors.2600740 |
| SSID | ssj0001515 |
| Score | 2.3009427 |
| Snippet | •Examine a two-machine flowshop scheduling problem with deteriorating jobs.•Minimize the total completion time subject to minimum makespan.•Propose a mixed... We study a two-machine flowshop scheduling problem with time-dependent deteriorating jobs, i.e. the processing times of jobs are an increasing function of... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 650 |
| SubjectTerms | Algorithms Branch & bound algorithms Branch-and-bound Deteriorating job Deterioration Dominance Hierarchical optimization Integer programming Job shops Mathematical analysis Mathematical models Mathematical problems Mixed integer programming Operational research Optimization Polynomials Production scheduling Scheduling Studies |
| Title | Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs |
| URI | https://dx.doi.org/10.1016/j.ejor.2013.09.033 https://www.proquest.com/docview/1491427418 https://www.proquest.com/docview/1530996751 |
| Volume | 234 |
| WOSCitedRecordID | wos000331419800007&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/eLvHCXMwtV1Lb9NAEF6FFiE48AhFBApaJMTFMvLa3tg-lioVoBI4pFJu1nq9qzgkdppH05_FT2TWu2unrVqVAxcrctZ2lPk8883sPBD6SIHXMxW5z_sed0MuY5dRRtw8FEQEnHGf83rYRDQcxuNx8qvT-WNrYS5mUVnGl5fJ4r-KGs6BsFXp7D-Iu7kpnIDPIHQ4gtjheC_BfylAEagOzMxRc67rnQIliAqUw9xUXdaZAdvKndeplMKRs2rrrCbVwgFnF4yPqVGvZ82YUG0xF66dmLt2cpVFU9TwgZXTKlvdGuI3dBdOLG3g0XQYaiLRxxOhVc4PuFvGqjackBe_2VzF-jXbLfNNExKykW6bn3MzBD5h59Ywm7gGCdssQlvPFUWu7-vKTqurfRP5LHZ9-Vrz9nX_WmPE-7rr9Q37oEMV089iWqlmsCTQTW6D1hraDIDhz_Tk7PQ0HQ3Go0-Lc1fNKVP7-WZoywO070c0AT26f_RtMP7eWH9FEOudK_PrTaGWzim8_tjbyNA1WlBzndFz9NQ4KfhIg-sF6oiyix7ZGokuemZngWBjGrroyU5jy5do24IQ74IQ74IQVxLvgBArEGIFQtyCEBsQYgVCfBWE-AoIsQLhATo7GYyOv7pmxIfLgZiv3UwKX4BPQHOSS-Caio-GSUSSLPE52JpMZkJkviepYKHHAikZlYwI4XmccpEHr9BeWZXiNcIxMCvZ72cyojJkfsSITAJJYgYWKxAx7SFi_-uUm_73agzLLLWJjtNUySdV8km9JAX59JDTXLPQ3V_uXE2tCFPDXzUvTQF-d153aOWdmvdyBS55QsK6t1QPfWi-Bt2vNvRYKaoNrKGgZRNw-cmbe6x5ix6379kh2lsvN-Idesgv1sVq-d7g-C_WvNrP |
| 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=Bicriteria+hierarchical+optimization+of+two-machine+flow+shop+scheduling+problem+with+time-dependent+deteriorating+jobs&rft.jtitle=European+journal+of+operational+research&rft.au=Cheng%2C+Mingbao&rft.au=Tadikamalla%2C+Pandu&rft.au=Shang%2C+Jennifer&rft.au=Zhang%2C+Shaqing&rft.date=2014-05-01&rft.issn=0377-2217&rft.volume=234&rft.issue=3&rft.spage=650&rft.epage=657&rft_id=info:doi/10.1016%2Fj.ejor.2013.09.033&rft.externalDBID=NO_FULL_TEXT |
| 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 |