The following pages link to A 71/60 theorem for bin packing (Q1083194):
Displaying 6 items.
- An improved two-machine flowshop scheduling with intermediate transportation (Q266074) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- Machine scheduling with a maintenance interval and job delivery coordination (Q518131) (← links)
- A variant of multi-task \(n\)-vehicle exploration problem: maximizing every processor's average profit (Q692666) (← links)
- On lazy bin covering and packing problems (Q1041247) (← links)
- A study on load-balanced variants of the bin packing problem (Q2422735) (← links)
