A flow shop scheduling problem with machine-dependent speeds: An ensemble approach with worst-case analysis
We consider a flow shop scheduling problem to minimize the total weighted completion time with any given job having the same processing requirement at all stages and each machine operating at its own speed. This problem is known to be NP-hard even for just two machines. In this paper, we propose a s...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.09.2025
|
| Schlagworte: | |
| ISSN: | 0377-2217 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We consider a flow shop scheduling problem to minimize the total weighted completion time with any given job having the same processing requirement at all stages and each machine operating at its own speed. This problem is known to be NP-hard even for just two machines. In this paper, we propose a simple yet efficient approximation algorithm that leverages the complementary strengths of existing approaches. We first establish that our algorithm achieves a strictly better approximation ratio than previously known methods for the two-machine case. We then extend our analysis to settings with more than two machines, focusing on scenarios where the number of distinct machine speeds is fixed. Finally, we use these insights to derive an approximation ratio for the general case of arbitrary machine speeds.
•Study a flow shop scheduling problem with machine-dependent speeds.•Propose a simple ensemble algorithm with approximation guarantees.•Prove the golden ratio bound for the two-machine case, improving prior results.•Analyze the case where the number of distinct machine speeds is fixed.•Extend the analysis to multiple machines with arbitrary machine speeds. |
|---|---|
| AbstractList | We consider a flow shop scheduling problem to minimize the total weighted completion time with any given job having the same processing requirement at all stages and each machine operating at its own speed. This problem is known to be NP-hard even for just two machines. In this paper, we propose a simple yet efficient approximation algorithm that leverages the complementary strengths of existing approaches. We first establish that our algorithm achieves a strictly better approximation ratio than previously known methods for the two-machine case. We then extend our analysis to settings with more than two machines, focusing on scenarios where the number of distinct machine speeds is fixed. Finally, we use these insights to derive an approximation ratio for the general case of arbitrary machine speeds.
•Study a flow shop scheduling problem with machine-dependent speeds.•Propose a simple ensemble algorithm with approximation guarantees.•Prove the golden ratio bound for the two-machine case, improving prior results.•Analyze the case where the number of distinct machine speeds is fixed.•Extend the analysis to multiple machines with arbitrary machine speeds. |
| Author | Park, Insoo Lee, Kangbok Pinedo, Michael |
| Author_xml | – sequence: 1 givenname: Insoo orcidid: 0009-0004-2521-4117 surname: Park fullname: Park, Insoo organization: Department of Industrial and Management Engineering, Pohang University of Science and Technology, Pohang, 37673, South Korea – sequence: 2 givenname: Kangbok orcidid: 0000-0002-3526-9865 surname: Lee fullname: Lee, Kangbok email: kblee@postech.ac.kr organization: Department of Industrial and Management Engineering, Pohang University of Science and Technology, Pohang, 37673, South Korea – sequence: 3 givenname: Michael orcidid: 0000-0001-7814-0642 surname: Pinedo fullname: Pinedo, Michael organization: Stern School of Business, New York University, New York, NY 10012, USA |
| BookMark | eNp9kL1OwzAUhT0UibbwAkx-gYRrl8QxYqkq_qRKLDBbjn1DHBI7sgNV355UZWY6wz3f1dG3IgsfPBJywyBnwMrbLscuxJwDL3KQObBqQZawESLjnIlLskqpAwBWsGJJvra06cOBpjaMNJkW7Xfv_CcdY6h7HOjBTS0dtGmdx8ziiN6in2gaEW26p1tP0Scc5i7V4wzNzTNzCDFNmdFpPnjdH5NLV-Si0X3C679ck4-nx_fdS7Z_e37dbfeZYWU1ZQywAmNlWdZ1VRdaWG0EIkNmdMOLWnJTFZyh3lhdQyGElrXlTSW5hDshms2a8PNfE0NKERs1RjfoeFQM1EmR6tRJkTopUiDVrGiGHs4Qzst-HEaVjENv0LqIZlI2uP_wXy66dmM |
| Cites_doi | 10.4153/CJM-1961-015-3 10.1287/ijoc.13.2.157.10520 10.1002/nav.3800010110 10.1007/s004930200018 10.1145/2027216.2027218 10.1287/opre.40.1.7 10.1016/j.ejor.2024.03.011 10.1002/nav.3800150207 10.1287/moor.1.2.117 10.1137/S0895480199326104 10.1137/S009753979222676X 10.1080/00207540500268780 10.1145/335305.335310 10.1016/S0377-2217(97)00139-2 10.1016/S0167-5060(08)70356-X 10.1007/BF02523683 10.1287/moor.22.3.513 10.1002/nav.3800030106 10.1016/j.ejor.2005.02.001 10.1016/j.ejor.2021.08.005 10.1287/moor.1080.0368 10.1002/jos.96 10.1287/mnsc.21.5.544 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y 10.1016/j.ejor.2019.07.006 10.1006/jagm.1998.0987 |
| ContentType | Journal Article |
| Copyright | 2025 Elsevier B.V. |
| Copyright_xml | – notice: 2025 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2025.09.018 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| ExternalDocumentID | 10_1016_j_ejor_2025_09_018 S0377221725007350 |
| GrantInformation_xml | – fundername: National Research Foundation of Korea (NRF) grantid: RS-2023-NR077171 funderid: http://dx.doi.org/10.13039/501100003725 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29G 4.4 41~ 457 4G. 5GY 5VS 6OB 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AATTM AAXKI AAXUO AAYFN AAYWO ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO ABWVN ABXDB ACDAQ ACGFO ACGFS ACIWK ACLOT ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADGUI ADIYS ADJOM ADMUD ADNMO ADXHL AEBSH AEFWE AEIPS AEKER AENEX AEUPX AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AOUOD APLSM APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HVGLF HZ~ IHE J1W KOM LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- ROL RPZ RXW SCC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSV SSW SSZ T5K TAE TN5 U5U VH1 WUQ XPP ZMT ~02 ~G- ~HD 9DU AAYXX CITATION |
| ID | FETCH-LOGICAL-c168t-10e80cd966bb8b5a7dac7ee1e1caf25b92c8521ea3dab0577a9bd2f89290477f3 |
| ISSN | 0377-2217 |
| IngestDate | Sat Nov 29 06:51:38 EST 2025 Sun Oct 19 01:37:41 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Scheduling with different machine speeds Scheduling Flow shop Approximation algorithm |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c168t-10e80cd966bb8b5a7dac7ee1e1caf25b92c8521ea3dab0577a9bd2f89290477f3 |
| ORCID | 0009-0004-2521-4117 0000-0002-3526-9865 0000-0001-7814-0642 |
| ParticipantIDs | crossref_primary_10_1016_j_ejor_2025_09_018 elsevier_sciencedirect_doi_10_1016_j_ejor_2025_09_018 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-9-00 |
| PublicationDateYYYYMMDD | 2025-09-01 |
| PublicationDate_xml | – month: 09 year: 2025 text: 2025-9-00 |
| PublicationDecade | 2020 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2025 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Alon, Srinivasan (b1) 1997; 17 Kramer, Iori, Lacomme (b21) 2021; 289 Mecler, Abu-Marrul, Martinelli, Hoff (b24) 2022; 300 Chekuri, Khanna (b5) 2002 Elmaghraby (b11) 1968; 15 Chakrabarti, Phillips, Schulz, Shmoys, Stein, Wein (b3) 1996 Hoogeveen, Schuurman, Woeginger (b19) 2001; 13 Smutnicki (b34) 1998; 109 Gupta, Stafford (b17) 2006; 169 Li (b22) 2017 Choi, Yoon, Chung (b7) 2006; 44 Hall, Schulz, Shmoys, Wein (b18) 1997; 22 Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems. In Schensted (b28) 1961; 13 Chekuri, Khanna (b4) 2001 Garey, Johnson, Sethi (b14) 1976; 1 Dudek, Panwalkar, Smith (b10) 1992; 40 Mastrolilli, Svensson (b23) 2011; 58 Chudak, Shmoys (b8) 1999; 30 Queyranne, Sviridenko (b27) 2002; 5 Graham, Lawler, Lenstra, Rinnooy Kan (b16) 1979; vol. 5 Shmoys, Stein, Wein (b31) 1994; 23 Johnson (b20) 1954; 1 Smith (b32) 1956; 3 Goldberg, Paterson, Srinivasan, Sweedyk (b15) 2001; 14 Nagarajan, Sviridenko (b25) 2009; 34 Schulz (b29) 1996 Bansal, Srinivasan, Svensson (b2) 2016 Emmons, Vairaktarakis (b12) 2012 Smith, Panwalkar, Dudek (b33) 1975; 21 Shakhlevich, Hoogeveen, Pinedo (b30) 1998; 1 Feige, Scheideler (b13) 2002; 22 (pp. 38–47). Chen, Chu, Sahli, Li (b6) 2024; 316 Pinedo (b26) 2022 Hoogeveen (10.1016/j.ejor.2025.09.018_b19) 2001; 13 Mecler (10.1016/j.ejor.2025.09.018_b24) 2022; 300 Chekuri (10.1016/j.ejor.2025.09.018_b5) 2002 Bansal (10.1016/j.ejor.2025.09.018_b2) 2016 Hall (10.1016/j.ejor.2025.09.018_b18) 1997; 22 Pinedo (10.1016/j.ejor.2025.09.018_b26) 2022 Smith (10.1016/j.ejor.2025.09.018_b32) 1956; 3 Smutnicki (10.1016/j.ejor.2025.09.018_b34) 1998; 109 Chakrabarti (10.1016/j.ejor.2025.09.018_b3) 1996 Kramer (10.1016/j.ejor.2025.09.018_b21) 2021; 289 Gupta (10.1016/j.ejor.2025.09.018_b17) 2006; 169 Shakhlevich (10.1016/j.ejor.2025.09.018_b30) 1998; 1 Alon (10.1016/j.ejor.2025.09.018_b1) 1997; 17 10.1016/j.ejor.2025.09.018_b9 Queyranne (10.1016/j.ejor.2025.09.018_b27) 2002; 5 Nagarajan (10.1016/j.ejor.2025.09.018_b25) 2009; 34 Chekuri (10.1016/j.ejor.2025.09.018_b4) 2001 Mastrolilli (10.1016/j.ejor.2025.09.018_b23) 2011; 58 Feige (10.1016/j.ejor.2025.09.018_b13) 2002; 22 Shmoys (10.1016/j.ejor.2025.09.018_b31) 1994; 23 Garey (10.1016/j.ejor.2025.09.018_b14) 1976; 1 Dudek (10.1016/j.ejor.2025.09.018_b10) 1992; 40 Emmons (10.1016/j.ejor.2025.09.018_b12) 2012 Graham (10.1016/j.ejor.2025.09.018_b16) 1979; vol. 5 Chen (10.1016/j.ejor.2025.09.018_b6) 2024; 316 Schulz (10.1016/j.ejor.2025.09.018_b29) 1996 Chudak (10.1016/j.ejor.2025.09.018_b8) 1999; 30 Elmaghraby (10.1016/j.ejor.2025.09.018_b11) 1968; 15 Goldberg (10.1016/j.ejor.2025.09.018_b15) 2001; 14 Choi (10.1016/j.ejor.2025.09.018_b7) 2006; 44 Schensted (10.1016/j.ejor.2025.09.018_b28) 1961; 13 Li (10.1016/j.ejor.2025.09.018_b22) 2017 Smith (10.1016/j.ejor.2025.09.018_b33) 1975; 21 Johnson (10.1016/j.ejor.2025.09.018_b20) 1954; 1 |
| References_xml | – start-page: 297 year: 2002 end-page: 305 ident: b5 article-title: Approximation schemes for preemptive weighted flow time publication-title: Proceedings of the thirty-fourth annual ACM Symposium on Theory of Computing – volume: 13 start-page: 179 year: 1961 end-page: 191 ident: b28 article-title: Longest increasing and decreasing subsequences publication-title: Canadian Journal of Mathematics – volume: 3 start-page: 59 year: 1956 end-page: 66 ident: b32 article-title: Various optimizers for single-stage production publication-title: Naval Research Logistics Quarterly – volume: 13 year: 2001 ident: b19 article-title: Non-approximability results for scheduling problems with minsum criteria publication-title: INFORMS Journal on Computing – volume: 44 start-page: 715 year: 2006 end-page: 728 ident: b7 article-title: Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds publication-title: International Journal of Production Research – volume: 22 start-page: 513 year: 1997 end-page: 544 ident: b18 article-title: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms publication-title: Mathematics of Operations Research – start-page: 156 year: 2016 end-page: 167 ident: b2 article-title: Lift-and-round to improve weighted completion time on unrelated machines publication-title: Proceedings of the forty-eighth annual ACM Symposium on Theory of Computing – volume: 23 start-page: 617 year: 1994 end-page: 632 ident: b31 article-title: Improved approximation algorithms for shop scheduling problems publication-title: SIAM Journal on Computing – volume: 289 start-page: 825 year: 2021 end-page: 840 ident: b21 article-title: Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization publication-title: European Journal of Operational Research – volume: 1 start-page: 157 year: 1998 end-page: 168 ident: b30 article-title: Minimizing total weighted completion time in a proportionate flow shop publication-title: Journal of Scheduling – volume: vol. 5 start-page: 287 year: 1979 end-page: 326 ident: b16 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey publication-title: Annals of Discrete Mathematics – volume: 1 start-page: 117 year: 1976 end-page: 129 ident: b14 article-title: The complexity of flowshop and jobshop scheduling publication-title: Mathematics of Operations Research – reference: Czumaj, A., & Scheideler, C. (2000). A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems. In – volume: 15 start-page: 205 year: 1968 end-page: 232 ident: b11 article-title: The machine sequencing problem–review and extensions publication-title: Naval Research Logistics Quarterly – reference: (pp. 38–47). – volume: 22 start-page: 361 year: 2002 end-page: 399 ident: b13 article-title: Improved bounds for acyclic job shop scheduling publication-title: Combinatorica – volume: 109 start-page: 66 year: 1998 end-page: 87 ident: b34 article-title: Some results of the worst-case analysis for flow shop scheduling publication-title: European Journal of Operational Research – year: 2012 ident: b12 article-title: Flow shop scheduling: Theoretical results, algorithms, and applications – volume: 58 start-page: 1 year: 2011 end-page: 32 ident: b23 article-title: Hardness of approximating flow and job shop scheduling problems publication-title: Journal of the ACM – volume: 169 start-page: 699 year: 2006 end-page: 711 ident: b17 article-title: Flowshop scheduling research after five decades publication-title: European Journal of Operational Research – volume: 34 start-page: 417 year: 2009 end-page: 427 ident: b25 article-title: Tight bounds for permutation flow shop scheduling publication-title: Mathematics of Operations Research – start-page: 301 year: 1996 end-page: 315 ident: b29 article-title: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds publication-title: International Conference on Integer Programming and Combinatorial Optimization – start-page: 35 year: 2022 end-page: 71 ident: b26 article-title: Single machine models (deterministic) publication-title: Scheduling: Theory, algorithms, and systems – volume: 21 start-page: 544 year: 1975 end-page: 549 ident: b33 article-title: Flowshop sequencing problem with ordered processing time matrices publication-title: Management Science – start-page: 283 year: 2017 end-page: 294 ident: b22 article-title: Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations publication-title: 2017 IEEE 58th annual symposium on Foundations of Computer Science – volume: 5 start-page: 287 year: 2002 end-page: 305 ident: b27 article-title: Approximation algorithms for shop scheduling problems with minsum objective publication-title: Journal of Scheduling – start-page: 848 year: 2001 end-page: 861 ident: b4 article-title: A PTAS for minimizing weighted completion time on uniformly related machines publication-title: Automata, Languages and Programming: 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings 28 – volume: 1 start-page: 61 year: 1954 end-page: 68 ident: b20 article-title: Optimal two-and three-stage production schedules with setup times included publication-title: Naval Research Logistics Quarterly – volume: 40 start-page: 7 year: 1992 end-page: 13 ident: b10 article-title: The lessons of flowshop scheduling research publication-title: Operations Research – volume: 17 start-page: 449 year: 1997 end-page: 462 ident: b1 article-title: Improved parallel approximation of a class of integer programming problems publication-title: Algorithmica – start-page: 646 year: 1996 end-page: 657 ident: b3 article-title: Improved scheduling algorithms for minsum criteria publication-title: Automata, Languages and Programming: 23rd International Colloquium, ICALP’96 Paderborn, Germany, July 8–12, 1996 Proceedings 23 – volume: 316 start-page: 856 year: 2024 end-page: 872 ident: b6 article-title: A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs publication-title: European Journal of Operational Research – volume: 300 start-page: 545 year: 2022 end-page: 560 ident: b24 article-title: Iterated greedy algorithms for a complex parallel machine scheduling problem publication-title: European Journal of Operational Research – volume: 30 start-page: 323 year: 1999 end-page: 343 ident: b8 article-title: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds publication-title: Journal of Algorithms – volume: 14 start-page: 67 year: 2001 end-page: 92 ident: b15 article-title: Better approximation guarantees for job-shop scheduling publication-title: SIAM Journal on Discrete Mathematics – start-page: 646 year: 1996 ident: 10.1016/j.ejor.2025.09.018_b3 article-title: Improved scheduling algorithms for minsum criteria – volume: 13 start-page: 179 year: 1961 ident: 10.1016/j.ejor.2025.09.018_b28 article-title: Longest increasing and decreasing subsequences publication-title: Canadian Journal of Mathematics doi: 10.4153/CJM-1961-015-3 – year: 2012 ident: 10.1016/j.ejor.2025.09.018_b12 – volume: 13 issue: 2 year: 2001 ident: 10.1016/j.ejor.2025.09.018_b19 article-title: Non-approximability results for scheduling problems with minsum criteria publication-title: INFORMS Journal on Computing doi: 10.1287/ijoc.13.2.157.10520 – volume: 1 start-page: 61 issue: 1 year: 1954 ident: 10.1016/j.ejor.2025.09.018_b20 article-title: Optimal two-and three-stage production schedules with setup times included publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800010110 – volume: 22 start-page: 361 issue: 3 year: 2002 ident: 10.1016/j.ejor.2025.09.018_b13 article-title: Improved bounds for acyclic job shop scheduling publication-title: Combinatorica doi: 10.1007/s004930200018 – volume: 58 start-page: 1 issue: 5 year: 2011 ident: 10.1016/j.ejor.2025.09.018_b23 article-title: Hardness of approximating flow and job shop scheduling problems publication-title: Journal of the ACM doi: 10.1145/2027216.2027218 – volume: 40 start-page: 7 issue: 1 year: 1992 ident: 10.1016/j.ejor.2025.09.018_b10 article-title: The lessons of flowshop scheduling research publication-title: Operations Research doi: 10.1287/opre.40.1.7 – volume: 316 start-page: 856 issue: 3 year: 2024 ident: 10.1016/j.ejor.2025.09.018_b6 article-title: A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2024.03.011 – volume: 15 start-page: 205 issue: 2 year: 1968 ident: 10.1016/j.ejor.2025.09.018_b11 article-title: The machine sequencing problem–review and extensions publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800150207 – volume: 1 start-page: 117 issue: 2 year: 1976 ident: 10.1016/j.ejor.2025.09.018_b14 article-title: The complexity of flowshop and jobshop scheduling publication-title: Mathematics of Operations Research doi: 10.1287/moor.1.2.117 – start-page: 156 year: 2016 ident: 10.1016/j.ejor.2025.09.018_b2 article-title: Lift-and-round to improve weighted completion time on unrelated machines – volume: 14 start-page: 67 issue: 1 year: 2001 ident: 10.1016/j.ejor.2025.09.018_b15 article-title: Better approximation guarantees for job-shop scheduling publication-title: SIAM Journal on Discrete Mathematics doi: 10.1137/S0895480199326104 – volume: 23 start-page: 617 issue: 3 year: 1994 ident: 10.1016/j.ejor.2025.09.018_b31 article-title: Improved approximation algorithms for shop scheduling problems publication-title: SIAM Journal on Computing doi: 10.1137/S009753979222676X – volume: 44 start-page: 715 issue: 4 year: 2006 ident: 10.1016/j.ejor.2025.09.018_b7 article-title: Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds publication-title: International Journal of Production Research doi: 10.1080/00207540500268780 – ident: 10.1016/j.ejor.2025.09.018_b9 doi: 10.1145/335305.335310 – volume: 109 start-page: 66 issue: 1 year: 1998 ident: 10.1016/j.ejor.2025.09.018_b34 article-title: Some results of the worst-case analysis for flow shop scheduling publication-title: European Journal of Operational Research doi: 10.1016/S0377-2217(97)00139-2 – volume: vol. 5 start-page: 287 year: 1979 ident: 10.1016/j.ejor.2025.09.018_b16 article-title: Optimization and approximation in deterministic sequencing and scheduling: A survey doi: 10.1016/S0167-5060(08)70356-X – volume: 17 start-page: 449 issue: 4 year: 1997 ident: 10.1016/j.ejor.2025.09.018_b1 article-title: Improved parallel approximation of a class of integer programming problems publication-title: Algorithmica doi: 10.1007/BF02523683 – start-page: 297 year: 2002 ident: 10.1016/j.ejor.2025.09.018_b5 article-title: Approximation schemes for preemptive weighted flow time – volume: 22 start-page: 513 issue: 3 year: 1997 ident: 10.1016/j.ejor.2025.09.018_b18 article-title: Scheduling to minimize average completion time: Off-line and on-line approximation algorithms publication-title: Mathematics of Operations Research doi: 10.1287/moor.22.3.513 – volume: 3 start-page: 59 issue: 1–2 year: 1956 ident: 10.1016/j.ejor.2025.09.018_b32 article-title: Various optimizers for single-stage production publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800030106 – volume: 169 start-page: 699 issue: 3 year: 2006 ident: 10.1016/j.ejor.2025.09.018_b17 article-title: Flowshop scheduling research after five decades publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2005.02.001 – start-page: 848 year: 2001 ident: 10.1016/j.ejor.2025.09.018_b4 article-title: A PTAS for minimizing weighted completion time on uniformly related machines – volume: 300 start-page: 545 issue: 2 year: 2022 ident: 10.1016/j.ejor.2025.09.018_b24 article-title: Iterated greedy algorithms for a complex parallel machine scheduling problem publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2021.08.005 – volume: 34 start-page: 417 issue: 2 year: 2009 ident: 10.1016/j.ejor.2025.09.018_b25 article-title: Tight bounds for permutation flow shop scheduling publication-title: Mathematics of Operations Research doi: 10.1287/moor.1080.0368 – volume: 5 start-page: 287 issue: 4 year: 2002 ident: 10.1016/j.ejor.2025.09.018_b27 article-title: Approximation algorithms for shop scheduling problems with minsum objective publication-title: Journal of Scheduling doi: 10.1002/jos.96 – volume: 21 start-page: 544 issue: 5 year: 1975 ident: 10.1016/j.ejor.2025.09.018_b33 article-title: Flowshop sequencing problem with ordered processing time matrices publication-title: Management Science doi: 10.1287/mnsc.21.5.544 – start-page: 35 year: 2022 ident: 10.1016/j.ejor.2025.09.018_b26 article-title: Single machine models (deterministic) – start-page: 283 year: 2017 ident: 10.1016/j.ejor.2025.09.018_b22 article-title: Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations – volume: 1 start-page: 157 issue: 3 year: 1998 ident: 10.1016/j.ejor.2025.09.018_b30 article-title: Minimizing total weighted completion time in a proportionate flow shop publication-title: Journal of Scheduling doi: 10.1002/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y – start-page: 301 year: 1996 ident: 10.1016/j.ejor.2025.09.018_b29 article-title: Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds – volume: 289 start-page: 825 issue: 3 year: 2021 ident: 10.1016/j.ejor.2025.09.018_b21 article-title: Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2019.07.006 – volume: 30 start-page: 323 issue: 2 year: 1999 ident: 10.1016/j.ejor.2025.09.018_b8 article-title: Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds publication-title: Journal of Algorithms doi: 10.1006/jagm.1998.0987 |
| SSID | ssj0001515 |
| Score | 2.4853148 |
| Snippet | We consider a flow shop scheduling problem to minimize the total weighted completion time with any given job having the same processing requirement at all... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| SubjectTerms | Approximation algorithm Flow shop Scheduling Scheduling with different machine speeds |
| Title | A flow shop scheduling problem with machine-dependent speeds: An ensemble approach with worst-case analysis |
| URI | https://dx.doi.org/10.1016/j.ejor.2025.09.018 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0377-2217 databaseCode: AIEXJ dateStart: 19950105 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0001515 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELZgixAceCwgCgX5wC0K2rhO7HCLUKsWpGoPRdpb5FeALY1Xm-3j5zOO7WzZ0ooeuESRJTuW55Pnm8k8EPpAC80aysAsKQxNqXHJysoFruWEN5pSVfCmbzbBjo74bFZOQ7ht17cTYG3LLy_LxX8VNYyBsF3q7B3EPSwKA_AOQocniB2e_yT4Kml-2Yuk-2EXCZiuoEpCxnnfOcY7Xk_7EEqTxha4q6RbgBrrgpsQTFtz6lKqYsVxP-vCAlVMFei9RIRaJjc69gPJhYFldDeGukKD_3kawrQP287ajcCgr6L9Lu2QRTSFzWq7GeYfnBUkH6KxhiQtxlJCfLrmtdvbOxLmH83culKtJO9L0Ib7-Y9S2RsqbAgsjDFr89qtUbs16klZwxr30RZheclHaKs63Jt9GdS1Y3T9r6aws5BZ5YMAN3fyd_ZyhZEcP0NPgimBKw-B5-ieacfoYcxkGKOnsWMHDhf4GD2-Un7yBTqpsIMKdlDBa6jgABXshI6vQQV7qHzCVYsjUHAEip-zBgqOQHmJvu3vHX8-SEPzjVRlBV-BejZ8ojRYw1JymQumhWLGZCZToiG5LIniQP2M2NVCAulnopSaNBzo9oQy1uy-QqPWtuY1wlpmwJQKkSvdUColmOTAggwBU0lxmvFtlMRDrRe-xkp9syC3UR7PvQ4s0bO_GmB0y7w3d_rKW_Rojd8dNFotz8w79ECdr352y_cBQ78Be6aM7Q |
| 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=A+flow+shop+scheduling+problem+with+machine-dependent+speeds%3A+An+ensemble+approach+with+worst-case+analysis&rft.jtitle=European+journal+of+operational+research&rft.au=Park%2C+Insoo&rft.au=Lee%2C+Kangbok&rft.au=Pinedo%2C+Michael&rft.date=2025-09-01&rft.issn=0377-2217&rft_id=info:doi/10.1016%2Fj.ejor.2025.09.018&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2025_09_018 |
| 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 |