Pages that link to "Item:Q1330553"
From MaRDI portal
The following pages link to Scheduling jobs to minimize total cost (Q1330553):
Displaying 6 items.
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- A fast bipartite network flow algorithm for selective assembly (Q1273091) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows (Q2378457) (← links)
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows (Q2503223) (← links)
- Complexity of source-sink monotone 2-parameter min cut (Q2670479) (← links)