The following pages link to (Q3145801):
Displayed 14 items.
- Selfish bin packing (Q534779) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times (Q1046715) (← links)
- Batched bin packing (Q1779689) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Online bin packing of fragile objects with application in cellular networks (Q2426651) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- Bin Packing with Queues (Q5504150) (← links)