Pages that link to "Item:Q3635001"
From MaRDI portal
The following pages link to The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem (Q3635001):
Displaying 13 items.
- Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← links)
- A graph theoretic-based heuristic algorithm for responsive supply chain network design with direct and indirect shipment (Q543889) (← links)
- A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem (Q909576) (← links)
- Optimal research and numerical simulation for scheduling no-wait flow shop in steel production (Q1789962) (← links)
- A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design (Q2393466) (← links)
- Designing optimal global supply chains at Dow AgroSciences (Q2393476) (← links)
- Scheduling a two-stage flowshop under makespan constraint (Q2476691) (← links)
- Asymptotically optimal schedules for single-server flow shop problems with setup costs and times (Q2488240) (← links)
- A joint replenishment policy with individual control and constant size orders (Q3163240) (← links)
- A Stochastic Programming Approach to Design Perishable Product Supply Chain Network Under Different Disruptions (Q3297315) (← links)
- The relationship between organizational structure, supply chain management, and organizational performance: a study on the semiconductor industry (Q3602250) (← links)
- On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem (Q4530655) (← links)
- Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates (Q5952071) (← links)
