Pages that link to "Item:Q4530655"
From MaRDI portal
The following pages link to On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem (Q4530655):
Displaying 8 items.
- Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
- How good are SPT schedules for fair optimality criteria (Q940873) (← links)
- An almost exact solution to the min completion time variance in a single machine (Q2239979) (← links)
- Research on optimization of production decision based on payment time and price coordination (Q2290936) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- Asymptotic analysis of online algorithms and improved scheme for the flow shop scheduling problem with release dates (Q2792935) (← links)
- The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem (Q3635001) (← links)
- Scheduling and due‐date quotation in a make‐to‐order supply chain (Q5393028) (← links)
