Pages that link to "Item:Q1906279"
From MaRDI portal
The following pages link to Dual decomposition of a single-machine scheduling problem (Q1906279):
Displaying 7 items.
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- Solving makespan minimization problems with Lagrangean decomposition (Q1209146) (← links)
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times (Q1608433) (← links)
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
- An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
- Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)