Pages that link to "Item:Q1197880"

The following pages link to Probabilistic analysis of the minimum weighted flowtime scheduling problem (Q1197880):

Displaying 10 items.

• Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
• Weighted flow time bounds for scheduling identical processors (Q1129956) (← links)
• On rates of convergence and asymptotic normality in the multiknapsack problem (Q1181902) (← links)
• Bounds and asymptotic results for the uniform parallel processor weighted flow time problem (Q1317007) (← links)
• Probabilistic analysis and practical algorithms for the flow shop weighted completion time problem (Q2770103) (← links)
• Probabilistic Analysis of a Machine Scheduling Problem (Q3680595) (← links)
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem (Q3757393) (← links)
• Scheduling and due‐date quotation in a make‐to‐order supply chain (Q5393028) (← links)
• A probabilistic analysis of the multi-period single-sourcing problem (Q5946827) (← links)