Pages that link to "Item:Q322561"
From MaRDI portal
The following pages link to Procedures for the bin packing problem with precedence constraints (Q322561):
Displayed 7 items.
- The robust (minmax regret) assembly line worker assignment and balancing problem (Q1652575) (← links)
- Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints (Q1985052) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Bin Packing Problem with Time Lags (Q5106420) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- R-SALSA: a branch, bound, and remember algorithm for the workload smoothing problem on simple assembly lines (Q6069213) (← links)