Pages that link to "Item:Q4530664"
From MaRDI portal
The following pages link to High Multiplicity in Earliness-Tardiness Scheduling (Q4530664):
Displaying 7 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
- A framework for the complexity of high-multiplicity scheduling problems (Q2569171) (← links)
- Scheduling with periodic availability constraints and irregular cost functions (Q3598681) (← links)
- Multiplicity and complexity issues in contemporary production scheduling (Q5422015) (← links)
- Parallel machine scheduling with high multiplicity (Q5930732) (← links)