Pages that link to "Item:Q5946719"
From MaRDI portal
The following pages link to A note on an open-end bin packing problem (Q5946719):
Displaying 17 items.
- The air-cargo consolidation problem with pivot weight: models and solution methods (Q337525) (← links)
- Batch scheduling of step deteriorating jobs (Q835578) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Integrated production and delivery scheduling with disjoint windows (Q972326) (← links)
- Asymptotic fully polynomial approximation schemes for variants of open-end bin packing (Q975519) (← links)
- Hardness of lazy packing and covering (Q1015303) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- Parameterized on-line open-end bin packing (Q1387710) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- More on ordered open end bin packing (Q2066681) (← links)
- On various open-end bin packing game (Q2149858) (← links)
- Open-end bin packing: new and old analysis approaches (Q2172402) (← links)
- Minimizing machine assignment costs over \(\Delta\)-approximate solutions of the scheduling problem \(P||C_{\max}\) (Q2326400) (← links)
- Scheduling two agent task chains with a central selection mechanism (Q2356118) (← links)
- Single machine scheduling with small operator-non-availability periods (Q2434272) (← links)
- A note on a variant of the online open end bin packing problem (Q2661578) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)