Search
Now showing items 1-2 of 2
The average shadow price for MILPs with Integral resource availability and its relationship to the marginal unit shadow price
(2006-10-27)
The economic significance of the average shadow price for integer and mixed integer linear programming (MILP)
problems has been established by researchers [Kim and Cho, Eur. J. Operat. Res. 37 (1988) 328; Crema Eur. J. ...
Applying machine-based decomposition in 2 machine flow shops
(2006-10-27)
The shifting bottleneck (SB) heuristic is among the most successful approximation methods for solving the job
shop problem. It is essentially a machine based decomposition procedure where a series of one machine ...