Competitive algorithms for multistage online scheduling
•We study online flow shop scheduling where jobs must be processed in several stages.•We show that a restricted version of the offline version of the problem is APX-hard.•We provide online algorithms and lower bounds for different variants of the problem. We study an online flow shop scheduling prob...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research Jg. 260; H. 2; S. 468 - 481 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
16.07.2017
|
| Schlagworte: | |
| ISSN: | 0377-2217, 1872-6860 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | •We study online flow shop scheduling where jobs must be processed in several stages.•We show that a restricted version of the offline version of the problem is APX-hard.•We provide online algorithms and lower bounds for different variants of the problem.
We study an online flow shop scheduling problem where each job consists of several tasks that have to be completed in t different stages and the goal is to maximize the total weight of accepted jobs. The set of tasks of a job contains one task for each stage and each stage has a dedicated set of identical parallel machines corresponding to it that can only process tasks of this stage. In order to gain the weight (profit) associated with a job j, each of its tasks has to be executed between a task-specific release date and deadline subject to the constraint that all tasks of job j from stages 1,⋯,i−1 have to be completed before the task of the ith stage can be started. In the online version, jobs arrive over time and all information about the tasks of a job becomes available at the release date of its first task. This model can be used to describe production processes in supply chains when customer orders arrive online.
Even the basic version of the offline problem with a single machine in each stage, unit weights, unit processing times, and fixed execution times for all tasks (i.e., deadline minus release date equals processing time) is APX-hard and we show that the approximation ratio of any polynomial-time approximation algorithm for this basic version of the problem must depend on the number t of stages.
For the online version of the basic problem, we provide a (2t−1)-competitive deterministic online algorithm and a matching lower bound. Moreover, we provide several (sometimes tight) upper and lower bounds on the competitive ratios of online algorithms for several generalizations of the basic problem involving different weights, arbitrary release dates and deadlines, different processing times of tasks, and several identical machines per stage. |
|---|---|
| AbstractList | •We study online flow shop scheduling where jobs must be processed in several stages.•We show that a restricted version of the offline version of the problem is APX-hard.•We provide online algorithms and lower bounds for different variants of the problem.
We study an online flow shop scheduling problem where each job consists of several tasks that have to be completed in t different stages and the goal is to maximize the total weight of accepted jobs. The set of tasks of a job contains one task for each stage and each stage has a dedicated set of identical parallel machines corresponding to it that can only process tasks of this stage. In order to gain the weight (profit) associated with a job j, each of its tasks has to be executed between a task-specific release date and deadline subject to the constraint that all tasks of job j from stages 1,⋯,i−1 have to be completed before the task of the ith stage can be started. In the online version, jobs arrive over time and all information about the tasks of a job becomes available at the release date of its first task. This model can be used to describe production processes in supply chains when customer orders arrive online.
Even the basic version of the offline problem with a single machine in each stage, unit weights, unit processing times, and fixed execution times for all tasks (i.e., deadline minus release date equals processing time) is APX-hard and we show that the approximation ratio of any polynomial-time approximation algorithm for this basic version of the problem must depend on the number t of stages.
For the online version of the basic problem, we provide a (2t−1)-competitive deterministic online algorithm and a matching lower bound. Moreover, we provide several (sometimes tight) upper and lower bounds on the competitive ratios of online algorithms for several generalizations of the basic problem involving different weights, arbitrary release dates and deadlines, different processing times of tasks, and several identical machines per stage. |
| Author | Thielen, Clemens Wendt, Oliver Hopf, Michael |
| Author_xml | – sequence: 1 givenname: Michael surname: Hopf fullname: Hopf, Michael email: hopf@mathematik.uni-kl.de organization: Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, Kaiserslautern D-67663, Germany – sequence: 2 givenname: Clemens surname: Thielen fullname: Thielen, Clemens email: thielen@mathematik.uni-kl.de organization: Department of Mathematics, University of Kaiserslautern, Paul-Ehrlich-Str. 14, Kaiserslautern D-67663, Germany – sequence: 3 givenname: Oliver surname: Wendt fullname: Wendt, Oliver email: wendt@wiwi.uni-kl.de organization: Department of Economics, University of Kaiserslautern, Erwin-Schrödinger-Str. 42, Kaiserslautern D-67663, Germany |
| BookMark | eNp9kM1KAzEYRYNUsK2-gKt5gRnzM5NkwI0UtULBja5DmnxpM8xMSpIWfHun1JWLru7dnAv3LNBsDCMg9EhwRTDhT10FXYgVnXpFaIVrcYPmRApacsnxDM0xE6KklIg7tEipwxiThjRzJFZhOED22Z-g0P0uRJ_3QypciMVw7LNPWe-gCGPvRyiS2YM9TnV3j26d7hM8_OUSfb-9fq3W5ebz_WP1sikNq2UuW44dc7bZttRwpp2EWm9tw53gmtWEEpBYC9dKi1ljak1aaABbSxkQwxxnSyQvuyaGlCI4ZXzW2YcxR-17RbA6C1CdOgtQZwGKUDUJmFD6Dz1EP-j4cx16vkAwnTp5iCoZD6MB6yOYrGzw1_BfdAh4Fw |
| CitedBy_id | crossref_primary_10_1080_23302674_2022_2141590 crossref_primary_10_1007_s10107_020_01502_4 crossref_primary_10_1007_s10951_018_0568_y crossref_primary_10_1080_00207543_2021_1978577 |
| Cites_doi | 10.1002/nav.3800090303 10.1145/1327452.1327492 10.1016/0166-218X(87)90037-0 10.1016/S0304-3975(01)00411-X 10.1007/BF00121680 10.1016/0166-218X(95)80003-M 10.1137/S0097539795283292 10.1137/S0097539703437843 10.1016/0166-218X(95)00112-5 10.1016/j.cor.2011.03.001 10.1007/BF02392825 10.1016/0022-0000(91)90023-X 10.1007/978-1-4613-0259-9_7 10.1016/j.ic.2013.10.004 10.1016/0304-3975(94)90150-3 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ejor.2016.12.047 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1872-6860 |
| EndPage | 481 |
| ExternalDocumentID | 10_1016_j_ejor_2016_12_047 S0377221717300024 |
| 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 AALRI AAOAW AAQFI AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABFRF ABJNI ABMAC ABUCO 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 AAQXK AATTM AAXKI AAYWO AAYXX ABWVN ABXDB 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 |
| ID | FETCH-LOGICAL-c348t-960f3fd5b92c63af8e4abd56f76a34121e80a7f98d035c4a19e5e0dd23e1c3f63 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000396952700006&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 | Tue Nov 18 21:51:08 EST 2025 Sat Nov 29 05:34:29 EST 2025 Fri Feb 23 02:27:38 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | Online optimization Competitive analysis Scheduling |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c348t-960f3fd5b92c63af8e4abd56f76a34121e80a7f98d035c4a19e5e0dd23e1c3f63 |
| PageCount | 14 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ejor_2016_12_047 crossref_primary_10_1016_j_ejor_2016_12_047 elsevier_sciencedirect_doi_10_1016_j_ejor_2016_12_047 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-07-16 |
| PublicationDateYYYYMMDD | 2017-07-16 |
| PublicationDate_xml | – month: 07 year: 2017 text: 2017-07-16 day: 16 |
| PublicationDecade | 2010 |
| PublicationTitle | European journal of operational research |
| PublicationYear | 2017 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Krumke, Thielen, Westphal (bib0025) 2011; 38 Fotakis, Milis, Papadigenopoulos, Zampetakis, Zois (bib0019) 2015; vol. 9125 Chlebík, Chlebíková (bib0014) 2005 Halldórsson (bib0022) 1995 Bachmann, Halldórsson, Shachnai (bib0002) 2013; 233 Chandra, Halldórsson (bib0012) 1999 Arkin, Silverberg (bib0001) 1987; 18 Faigle, Nawjin (bib0018) 1995; 58 Moseley, Dasgupta, Kumar, Sarlós (bib0026) 2011 Dean, Ghemawat (bib0015) 2008; 51 Berman, Karpinski (bib0007) 1999; vol. 1644 Bafna, Narayanan, Ravi (bib0003) 1995 Göbel, Hoefer, Kesselheim, Schleiden, Vöcking (bib0021) 2014; vol. 8573 Charnes, Cooper (bib0013) 1962; 9 Faigle, Nawjin (bib0017) 1991 Woeginger (bib0028) 1994; 130 Berman, DasGupta (bib0006) 2002; vol. 1 Epstein, Levin (bib0016) 2008; vol. 5193 Berman (bib0005) 2000; 7 Halldórsson, Iwama, Miyazaki, Taketomi (bib0023) 2002; 289 Canetti, Irani (bib0010) 1998; 27 Carlisle, Lloyd (bib0011) 1995; 59 Fung, Poon, Zheng (bib0020) 2009 Borodin, El-Yaniv (bib0008) 1998 Håstad (bib0024) 1999; 182 Papadimitriou, Yannakakis (bib0027) 1991; 43 Bar-Yehuda, Halldórsson, Naor, Shachnai, Shapira (bib0004) 2006; 36 Bouzina, Emmons (bib0009) 1996; 9 Borodin (10.1016/j.ejor.2016.12.047_bib0008) 1998 Chandra (10.1016/j.ejor.2016.12.047_bib0012) 1999 Dean (10.1016/j.ejor.2016.12.047_bib0015) 2008; 51 Canetti (10.1016/j.ejor.2016.12.047_bib0010) 1998; 27 Charnes (10.1016/j.ejor.2016.12.047_bib0013) 1962; 9 Fung (10.1016/j.ejor.2016.12.047_bib0020) 2009 Bachmann (10.1016/j.ejor.2016.12.047_bib0002) 2013; 233 Carlisle (10.1016/j.ejor.2016.12.047_bib0011) 1995; 59 Halldórsson (10.1016/j.ejor.2016.12.047_bib0023) 2002; 289 Fotakis (10.1016/j.ejor.2016.12.047_bib0019) 2015; vol. 9125 Bafna (10.1016/j.ejor.2016.12.047_bib0003) 1995 Håstad (10.1016/j.ejor.2016.12.047_bib0024) 1999; 182 Krumke (10.1016/j.ejor.2016.12.047_bib0025) 2011; 38 Berman (10.1016/j.ejor.2016.12.047_bib0006) 2002; vol. 1 Berman (10.1016/j.ejor.2016.12.047_bib0007) 1999; vol. 1644 Göbel (10.1016/j.ejor.2016.12.047_bib0021) 2014; vol. 8573 Berman (10.1016/j.ejor.2016.12.047_bib0005) 2000; 7 Faigle (10.1016/j.ejor.2016.12.047_bib0018) 1995; 58 Halldórsson (10.1016/j.ejor.2016.12.047_bib0022) 1995 Bouzina (10.1016/j.ejor.2016.12.047_bib0009) 1996; 9 Woeginger (10.1016/j.ejor.2016.12.047_bib0028) 1994; 130 Moseley (10.1016/j.ejor.2016.12.047_bib0026) 2011 Faigle (10.1016/j.ejor.2016.12.047_bib0017) 1991 Papadimitriou (10.1016/j.ejor.2016.12.047_bib0027) 1991; 43 Bar-Yehuda (10.1016/j.ejor.2016.12.047_bib0004) 2006; 36 Epstein (10.1016/j.ejor.2016.12.047_bib0016) 2008; vol. 5193 Arkin (10.1016/j.ejor.2016.12.047_bib0001) 1987; 18 Chlebík (10.1016/j.ejor.2016.12.047_bib0014) 2005 |
| References_xml | – volume: vol. 8573 start-page: 508 year: 2014 end-page: 519 ident: bib0021 article-title: Online independent set beyond the worst-case: Secretaries, prophets, and periods publication-title: Proceedings of the 41st international colloquium on automata, languages and programming (ICALP) – volume: 58 start-page: 13 year: 1995 end-page: 17 ident: bib0018 article-title: Note on scheduling intervals online publication-title: Discrete Applied Mathematics – year: 1991 ident: bib0017 article-title: Greedy k-coverings of interval orders publication-title: Technical report 979 – volume: 43 start-page: 425 year: 1991 end-page: 440 ident: bib0027 article-title: Optimization, approximation, and complexity classes publication-title: Journal of Computer and System Sciences – start-page: 160 year: 1995 end-page: 169 ident: bib0022 article-title: Approximating discrete collections via local improvements publication-title: Proceedings of the 6th ACM-SIAM symposium on discrete algorithms (SODA) – volume: 9 start-page: 379 year: 1996 end-page: 393 ident: bib0009 article-title: Interval scheduling on identical machines publication-title: Journal of Global Optimization – volume: vol. 5193 start-page: 381 year: 2008 end-page: 392 ident: bib0016 article-title: Improved randomized results for that interval selection problem publication-title: Proceedings of the 16th annual European symposium on algorithms (ESA) – year: 1998 ident: bib0008 publication-title: Online computation and competitive analysis – volume: 130 start-page: 5 year: 1994 end-page: 16 ident: bib0028 article-title: Online scheduling of jobs with fixed start and end times publication-title: Theoretical Computer Science – start-page: 53 year: 2009 end-page: 66 ident: bib0020 article-title: Improved randomized online scheduling of unit length intervals and jobs publication-title: Proceeding of the 6th workshop on approximation and online algorithms (WAOA) – start-page: 289 year: 2011 end-page: 298 ident: bib0026 article-title: On scheduling in map-reduce and flow-shops publication-title: Proceedings of the 23rd annual ACM symposium on parallelism in algorithms and architectures (SPAA) – start-page: 506 year: 1995 end-page: 517 ident: bib0003 article-title: Non-overlapping local alignments (weighted independent sets of axis parallel rectangles) publication-title: Proceedings of the 4th international workshop on algorithms and data structures (WADS) – volume: 36 start-page: 1 year: 2006 end-page: 15 ident: bib0004 article-title: Scheduling split intervals publication-title: SIAM Journal on Computing – volume: 38 start-page: 1836 year: 2011 end-page: 1844 ident: bib0025 article-title: Interval scheduling on related machines publication-title: Computers and Operations Research – volume: 9 start-page: 181 year: 1962 end-page: 186 ident: bib0013 article-title: Programming with linear fractional functionals publication-title: Naval Research Logistics Quarterly – volume: vol. 1 start-page: 129 year: 2002 end-page: 138 ident: bib0006 article-title: A simple approximation algorithm for nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) publication-title: Biocomputing – volume: vol. 9125 start-page: 137 year: 2015 end-page: 150 ident: bib0019 article-title: Scheduling mapreduce jobs and data shuffle on unrelated processors publication-title: Proceedings of the 14th international symposium on experimental algorithms (SEA) – start-page: 169 year: 1999 end-page: 176 ident: bib0012 article-title: Greedy local improvement and weighted set packing approximation publication-title: Proceedings of the 10th ACM-SIAM symposium on discrete algorithms (SODA) – volume: 18 start-page: 1 year: 1987 end-page: 8 ident: bib0001 article-title: Scheduling jobs with fixed start and end times publication-title: Discrete Applied Mathematics – volume: 27 start-page: 993 year: 1998 end-page: 1015 ident: bib0010 article-title: Bounding the power of preemption in randomized scheduling publication-title: SIAM Journal on Computing – volume: vol. 1644 start-page: 200 year: 1999 end-page: 209 ident: bib0007 article-title: On some tighter inapproximability results publication-title: Proceedings of the 26th international colloquium on automata, languages and programming (ICALP) – volume: 7 start-page: 178 year: 2000 end-page: 184 ident: bib0005 article-title: A publication-title: Nordic Journal of Computing – start-page: 267 year: 2005 end-page: 276 ident: bib0014 article-title: Approximation hardness of optimization problems in intersection graphs of publication-title: Proceedings of the 16th ACM-SIAM symposium on discrete algorithms (SODA) – volume: 182 start-page: 105 year: 1999 end-page: 142 ident: bib0024 article-title: Clique is hard to approximate within publication-title: Acta Mathematica – volume: 233 start-page: 1 year: 2013 end-page: 11 ident: bib0002 article-title: Online selection of intervals and publication-title: Information and Computation – volume: 51 start-page: 107 year: 2008 end-page: 113 ident: bib0015 article-title: Mapreduce: Simplified data processing on large clusters publication-title: Communications of the ACM – volume: 289 start-page: 953 year: 2002 end-page: 962 ident: bib0023 article-title: Online independent sets publication-title: Theoretical Computer Science – volume: 59 start-page: 225 year: 1995 end-page: 235 ident: bib0011 article-title: On the publication-title: Discrete Applied Mathematics – start-page: 506 year: 1995 ident: 10.1016/j.ejor.2016.12.047_bib0003 article-title: Non-overlapping local alignments (weighted independent sets of axis parallel rectangles) – year: 1991 ident: 10.1016/j.ejor.2016.12.047_bib0017 article-title: Greedy k-coverings of interval orders – volume: 9 start-page: 181 issue: 3–4 year: 1962 ident: 10.1016/j.ejor.2016.12.047_bib0013 article-title: Programming with linear fractional functionals publication-title: Naval Research Logistics Quarterly doi: 10.1002/nav.3800090303 – volume: 51 start-page: 107 issue: 1 year: 2008 ident: 10.1016/j.ejor.2016.12.047_bib0015 article-title: Mapreduce: Simplified data processing on large clusters publication-title: Communications of the ACM doi: 10.1145/1327452.1327492 – volume: 18 start-page: 1 issue: 1 year: 1987 ident: 10.1016/j.ejor.2016.12.047_bib0001 article-title: Scheduling jobs with fixed start and end times publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(87)90037-0 – start-page: 169 year: 1999 ident: 10.1016/j.ejor.2016.12.047_bib0012 article-title: Greedy local improvement and weighted set packing approximation – volume: 7 start-page: 178 issue: 3 year: 2000 ident: 10.1016/j.ejor.2016.12.047_bib0005 article-title: A d/2 approximation for maximum weight independent set in d-claw free graphs publication-title: Nordic Journal of Computing – volume: 289 start-page: 953 issue: 2 year: 2002 ident: 10.1016/j.ejor.2016.12.047_bib0023 article-title: Online independent sets publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(01)00411-X – start-page: 289 year: 2011 ident: 10.1016/j.ejor.2016.12.047_bib0026 article-title: On scheduling in map-reduce and flow-shops – volume: 9 start-page: 379 issue: 3–4 year: 1996 ident: 10.1016/j.ejor.2016.12.047_bib0009 article-title: Interval scheduling on identical machines publication-title: Journal of Global Optimization doi: 10.1007/BF00121680 – volume: 59 start-page: 225 issue: 3 year: 1995 ident: 10.1016/j.ejor.2016.12.047_bib0011 article-title: On the k-coloring of intervals publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(95)80003-M – volume: 27 start-page: 993 issue: 4 year: 1998 ident: 10.1016/j.ejor.2016.12.047_bib0010 article-title: Bounding the power of preemption in randomized scheduling publication-title: SIAM Journal on Computing doi: 10.1137/S0097539795283292 – volume: 36 start-page: 1 issue: 1 year: 2006 ident: 10.1016/j.ejor.2016.12.047_bib0004 article-title: Scheduling split intervals publication-title: SIAM Journal on Computing doi: 10.1137/S0097539703437843 – volume: 58 start-page: 13 issue: 1 year: 1995 ident: 10.1016/j.ejor.2016.12.047_bib0018 article-title: Note on scheduling intervals online publication-title: Discrete Applied Mathematics doi: 10.1016/0166-218X(95)00112-5 – start-page: 53 year: 2009 ident: 10.1016/j.ejor.2016.12.047_bib0020 article-title: Improved randomized online scheduling of unit length intervals and jobs – volume: 38 start-page: 1836 issue: 12 year: 2011 ident: 10.1016/j.ejor.2016.12.047_bib0025 article-title: Interval scheduling on related machines publication-title: Computers and Operations Research doi: 10.1016/j.cor.2011.03.001 – start-page: 267 year: 2005 ident: 10.1016/j.ejor.2016.12.047_bib0014 article-title: Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes – volume: 182 start-page: 105 year: 1999 ident: 10.1016/j.ejor.2016.12.047_bib0024 article-title: Clique is hard to approximate within n1−ϵ publication-title: Acta Mathematica doi: 10.1007/BF02392825 – start-page: 160 year: 1995 ident: 10.1016/j.ejor.2016.12.047_bib0022 article-title: Approximating discrete collections via local improvements – volume: 43 start-page: 425 issue: 3 year: 1991 ident: 10.1016/j.ejor.2016.12.047_bib0027 article-title: Optimization, approximation, and complexity classes publication-title: Journal of Computer and System Sciences doi: 10.1016/0022-0000(91)90023-X – volume: vol. 8573 start-page: 508 year: 2014 ident: 10.1016/j.ejor.2016.12.047_bib0021 article-title: Online independent set beyond the worst-case: Secretaries, prophets, and periods – volume: vol. 1 start-page: 129 year: 2002 ident: 10.1016/j.ejor.2016.12.047_bib0006 article-title: A simple approximation algorithm for nonoverlapping local alignments (weighted independent sets of axis parallel rectangles) doi: 10.1007/978-1-4613-0259-9_7 – volume: vol. 5193 start-page: 381 year: 2008 ident: 10.1016/j.ejor.2016.12.047_bib0016 article-title: Improved randomized results for that interval selection problem – volume: 233 start-page: 1 year: 2013 ident: 10.1016/j.ejor.2016.12.047_bib0002 article-title: Online selection of intervals and t-intervals publication-title: Information and Computation doi: 10.1016/j.ic.2013.10.004 – volume: vol. 1644 start-page: 200 year: 1999 ident: 10.1016/j.ejor.2016.12.047_bib0007 article-title: On some tighter inapproximability results – volume: 130 start-page: 5 issue: 1 year: 1994 ident: 10.1016/j.ejor.2016.12.047_bib0028 article-title: Online scheduling of jobs with fixed start and end times publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(94)90150-3 – volume: vol. 9125 start-page: 137 year: 2015 ident: 10.1016/j.ejor.2016.12.047_bib0019 article-title: Scheduling mapreduce jobs and data shuffle on unrelated processors – year: 1998 ident: 10.1016/j.ejor.2016.12.047_bib0008 |
| SSID | ssj0001515 |
| Score | 2.255441 |
| Snippet | •We study online flow shop scheduling where jobs must be processed in several stages.•We show that a restricted version of the offline version of the problem... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 468 |
| SubjectTerms | Competitive analysis Online optimization Scheduling |
| Title | Competitive algorithms for multistage online scheduling |
| URI | https://dx.doi.org/10.1016/j.ejor.2016.12.047 |
| Volume | 260 |
| WOSCitedRecordID | wos000396952700006&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/eLvHCXMwtV3fb9MwED6VDiF4GFBADAbKA29TUOI4sf04TUMbQoOHAX2LnNgGVVFaVWPan8_5VxrKNrEHXqLKapzW9-XufL77DuCdIBpRIViaN1SllEqVNpnOUtNUjAklJXdkOt8-sbMzPp-LL5OJibUwlx3re351JVb_VdQ4hsK2pbN3EPcwKQ7gZxQ6XlHseP0nwR85T9inBMnuxxJ3_z8964LPHkR30AYKHEPGAe5t0dZ00X5dF6IP7ioOrGPgMDAEDZHkk-XKbOfgu2QTW73uT_Vdlvrgv3_XvXLa_3Nn80LGoYfcxTR9ZWQsuWIsJcQXX0Z1Snx_gIAbMlKO1DfQCXaW-lYtf6lwH01YvNeLpeVrzSsXrvW0nH_yZW_ZsSG7MCauLWo7R23nqHNS4xz3YIewUvAp7ByeHs8_DjbbunXuvCn8oVBe5TMBt3_J9S7MyC05fwK7YT-RHHocPIWJ7mfwIJYzzOBxbNuRBC0-g0cjDspnwEZ4STZ4SRAvyQYvicdLssHLc_j64fj86CQN3TTStqD8IsWtqimMKhtB2qqQhmsqG1VWhlUSXRmSa55JZgRXWVG2VOZClzpTihQ6bwtTFS9g2i97_RISSjW--byUUjJqOBeVolnL7Ale0-jK7EEeF6huA9W87XjS1TeLZg8OhntWnmjl1m-Xcd3r4Cp6F7BGGN1y36s7PeU1PNzAfh-mF-tf-g3cby9x7ddvA4Z-A9fZjRI |
| 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=Competitive+algorithms+for+multistage+online+scheduling&rft.jtitle=European+journal+of+operational+research&rft.au=Hopf%2C+Michael&rft.au=Thielen%2C+Clemens&rft.au=Wendt%2C+Oliver&rft.date=2017-07-16&rft.issn=0377-2217&rft.volume=260&rft.issue=2&rft.spage=468&rft.epage=481&rft_id=info:doi/10.1016%2Fj.ejor.2016.12.047&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ejor_2016_12_047 |
| 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 |