On the asymptotic optimality of algorithms for the flow shop problem with release dates
From MaRDI portal
Publication:4680463
DOI10.1002/NAV.20066zbMATH Open1090.90087OpenAlexW2077698456MaRDI QIDQ4680463FDOQ4680463
Authors: Hui Liu, Maurice Queyranne, David Simchi-Levi
Publication date: 1 June 2005
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20066
Recommendations
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- Optimal results and numerical simulations for flow shop scheduling problems
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (15)
- The expected asymptotical ratio for preemptive stochastic online problem
- Minimizing maximum lateness in a flow shop subject to release dates
- Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
- Optimal results and numerical simulations for flow shop scheduling problems
- Online optimisation for ambulance routing in disaster response with partial or no information on victim conditions
- Probabilistic analysis of the minimum weighted flowtime scheduling problem
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- Title not available (Why is that?)
- Performance analysis of policy of heuristic for the stochastic flexible flow shop weighted completion time scheduling problem
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
- The effectiveness of the longest delivery time rule for the flow shop delivery time problem
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
This page was built for publication: On the asymptotic optimality of algorithms for the flow shop problem with release dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4680463)