Pages that link to "Item:Q5952071"
From MaRDI portal
The following pages link to Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071):
Displaying 10 items.
- The expected asymptotical ratio for preemptive stochastic online problem (Q391147) (← links)
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
- Optimal control of a two-server flow-shop network (Q892910) (← links)
- An optimal semi-online algorithm for a single machine scheduling problem with bounded processing time (Q991796) (← links)
- Coordinating a decentralized hybrid push-pull assembly system with unreliable supply and uncertain demand (Q1699188) (← links)
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates (Q2490322) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates (Q2792935) (← links)
- Almost sure asymptotic optimality for online routing and machine scheduling problems (Q3057128) (← links)
- Scheduling and due‐date quotation in a make‐to‐order supply chain (Q5393028) (← links)
