On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
From MaRDI portal
Publication:4530655
Recommendations
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
- Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem
- Optimal results and numerical simulations for flow shop scheduling problems
- The Asymptotic Optimality of the LPT Rule
- Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
Cited in
(10)- Scheduling and due-date quotation in a make-to-order supply chain
- SPT optimality (mostly) via linear programming
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
- An almost exact solution to the min completion time variance in a single machine
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling
- How good are SPT schedules for fair optimality criteria
- Research on optimization of production decision based on payment time and price coordination
- 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
This page was built for publication: On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4530655)