Pages that link to "Item:Q1041349"
From MaRDI portal
The following pages link to Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349):
Displaying 5 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- High-multiplicity scheduling on one machine with forbidden start and completion times (Q341471) (← links)
- An approximate algorithm for a high-multiplicity parallel machine scheduling problem (Q991471) (← links)
- A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria (Q1762126) (← links)
- Cyclic lot-sizing problems with sequencing costs (Q2061136) (← links)
