Pages that link to "Item:Q1421479"
From MaRDI portal
The following pages link to Non-approximability of precedence-constrained sequencing to minimize setups. (Q1421479):
Displaying 5 items.
- A note on the precedence-constrained class sequencing problem (Q868379) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs (Q3329199) (← links)