Matches in SemOpenAlex for { <https://semopenalex.org/work/W4233311280> ?p ?o ?g. }
- W4233311280 endingPage "12" @default.
- W4233311280 startingPage "2" @default.
- W4233311280 abstract "Abstract In this article, we study algorithms for online routing and machine scheduling problems. The problems are “online” because the problem instances are revealed incrementally. We first study algorithms for the online Traveling Repairman Problem (TRP), where a single server is to visit a set of locations in a network with the objective of minimizing the sum of weighted completion times. We then analyze well‐known online algorithms for a variety of machine scheduling problems, which are appropriate models for many network optimization problems; in the scheduling notation of Graham et al. 18 , we consider 1| r j , p m t n |∑ j w j C j , 1| r j |∑ j w j C j , Q | r j , p m t n |∑ j C j , P | r j |∑ j C j , Q | r j , p m t n |∑ j w j C j and Q | r j |∑ j w j C j . We introduce general probabilistic assumptions about the problem data as a tool to study the online algorithms for these online combinatorial problems. The algorithms do not utilize the underlying probabilistic assumptions in any way. We prove that these online algorithms are almost surely asymptotically optimal. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010" @default.
- W4233311280 created "2022-05-12" @default.
- W4233311280 creator A5018942019 @default.
- W4233311280 creator A5087774783 @default.
- W4233311280 date "2009-12-10" @default.
- W4233311280 modified "2023-09-30" @default.
- W4233311280 title "Almost sure asymptotic optimality for online routing and machine scheduling problems" @default.
- W4233311280 cites W1488422606 @default.
- W4233311280 cites W1501070407 @default.
- W4233311280 cites W1722876370 @default.
- W4233311280 cites W1966793805 @default.
- W4233311280 cites W1982070045 @default.
- W4233311280 cites W1988328380 @default.
- W4233311280 cites W1995284651 @default.
- W4233311280 cites W1998775324 @default.
- W4233311280 cites W2009006795 @default.
- W4233311280 cites W2013170874 @default.
- W4233311280 cites W2014068360 @default.
- W4233311280 cites W2026040656 @default.
- W4233311280 cites W2066528983 @default.
- W4233311280 cites W2067434762 @default.
- W4233311280 cites W2072136110 @default.
- W4233311280 cites W2081798943 @default.
- W4233311280 cites W2092438148 @default.
- W4233311280 cites W2096716071 @default.
- W4233311280 cites W2098465634 @default.
- W4233311280 cites W2111697972 @default.
- W4233311280 cites W2123258733 @default.
- W4233311280 cites W2126520302 @default.
- W4233311280 cites W2134115887 @default.
- W4233311280 cites W2144300893 @default.
- W4233311280 cites W2146321208 @default.
- W4233311280 cites W2159448554 @default.
- W4233311280 cites W2162228023 @default.
- W4233311280 cites W3135987664 @default.
- W4233311280 cites W4248362584 @default.
- W4233311280 doi "https://doi.org/10.1002/net.20309" @default.
- W4233311280 hasPublicationYear "2009" @default.
- W4233311280 type Work @default.
- W4233311280 citedByCount "8" @default.
- W4233311280 countsByYear W42333112802014 @default.
- W4233311280 countsByYear W42333112802015 @default.
- W4233311280 countsByYear W42333112802017 @default.
- W4233311280 countsByYear W42333112802021 @default.
- W4233311280 countsByYear W42333112802022 @default.
- W4233311280 crossrefType "journal-article" @default.
- W4233311280 hasAuthorship W4233311280A5018942019 @default.
- W4233311280 hasAuthorship W4233311280A5087774783 @default.
- W4233311280 hasBestOaLocation W42333112802 @default.
- W4233311280 hasConcept C11413529 @default.
- W4233311280 hasConcept C114614502 @default.
- W4233311280 hasConcept C118615104 @default.
- W4233311280 hasConcept C126255220 @default.
- W4233311280 hasConcept C154945302 @default.
- W4233311280 hasConcept C181789720 @default.
- W4233311280 hasConcept C196921405 @default.
- W4233311280 hasConcept C206729178 @default.
- W4233311280 hasConcept C31258907 @default.
- W4233311280 hasConcept C33923547 @default.
- W4233311280 hasConcept C41008148 @default.
- W4233311280 hasConcept C45357846 @default.
- W4233311280 hasConcept C49937458 @default.
- W4233311280 hasConcept C55416958 @default.
- W4233311280 hasConcept C74172769 @default.
- W4233311280 hasConcept C94375191 @default.
- W4233311280 hasConceptScore W4233311280C11413529 @default.
- W4233311280 hasConceptScore W4233311280C114614502 @default.
- W4233311280 hasConceptScore W4233311280C118615104 @default.
- W4233311280 hasConceptScore W4233311280C126255220 @default.
- W4233311280 hasConceptScore W4233311280C154945302 @default.
- W4233311280 hasConceptScore W4233311280C181789720 @default.
- W4233311280 hasConceptScore W4233311280C196921405 @default.
- W4233311280 hasConceptScore W4233311280C206729178 @default.
- W4233311280 hasConceptScore W4233311280C31258907 @default.
- W4233311280 hasConceptScore W4233311280C33923547 @default.
- W4233311280 hasConceptScore W4233311280C41008148 @default.
- W4233311280 hasConceptScore W4233311280C45357846 @default.
- W4233311280 hasConceptScore W4233311280C49937458 @default.
- W4233311280 hasConceptScore W4233311280C55416958 @default.
- W4233311280 hasConceptScore W4233311280C74172769 @default.
- W4233311280 hasConceptScore W4233311280C94375191 @default.
- W4233311280 hasIssue "1" @default.
- W4233311280 hasLocation W42333112801 @default.
- W4233311280 hasLocation W42333112802 @default.
- W4233311280 hasOpenAccess W4233311280 @default.
- W4233311280 hasPrimaryLocation W42333112801 @default.
- W4233311280 hasRelatedWork W2036784014 @default.
- W4233311280 hasRelatedWork W2049627958 @default.
- W4233311280 hasRelatedWork W2068528676 @default.
- W4233311280 hasRelatedWork W2094578294 @default.
- W4233311280 hasRelatedWork W2163017071 @default.
- W4233311280 hasRelatedWork W2520902986 @default.
- W4233311280 hasRelatedWork W2530969325 @default.
- W4233311280 hasRelatedWork W2762128374 @default.
- W4233311280 hasRelatedWork W2889114784 @default.
- W4233311280 hasRelatedWork W4236295709 @default.
- W4233311280 hasVolume "55" @default.
- W4233311280 isParatext "false" @default.