Stochastic customer order scheduling to minimize long-run expected order cycle time
From MaRDI portal
Cites work
- A note on the complexity of the concurrent open shop problem
- Analysis of the fork-join queue
- Concurrent open shop scheduling to minimize the weighted number of tardy jobs
- Coordinated scheduling of customer orders for quick response
- Estimating the cycle time of three-stage material handling systems
- scientific article; zbMATH DE number 2221456 (Why is no real title available?)
- Operational decisions in AGV-served flowshop loops: Scheduling
- Order scheduling in an environment with dedicated resources in parallel
- Order Scheduling Models: Hardness and Algorithms
- Queueing models with maxima of service times.
- Scheduling orders for multiple product types to minimize total weighted completion time
- Scheduling orders for multiple product types with due date related objectives
- Scheduling parallel machines for the customer order problem
- Synchronized queues with deterministic arrivals
- The complexity of customer order scheduling problems on parallel machines
- The customer order lead-time problem on parallel machines
- The effect of variability in the GI/G/s queue
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
- Two Parallel Queues Created by Arrivals with Two Demands I
- Two Parallel Queues Created by Arrivals with Two Demands II
This page was built for publication: Stochastic customer order scheduling to minimize long-run expected order cycle time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947340)