Pages that link to "Item:Q1046097"

The following pages link to New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097):

Displaying 17 items.

• A hybrid heuristic algorithm for the 2D variable-sized bin packing problem (Q296697) (← links)
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems (Q336709) (← links)
• A simple randomized algorithm for two-dimensional strip packing (Q339530) (← links)
• Scheduling inspired models for two-dimensional packing problems (Q421612) (← links)
• A hybrid demon algorithm for the two-dimensional orthogonal strip packing problem (Q1665961) (← links)
• iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
• A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint (Q1761795) (← links)
• A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem (Q2077966) (← links)
• A goal-driven ruin and recreate heuristic for the 2D variable-sized bin packing problem with guillotine constraints (Q2140189) (← links)
• Lower bounds for three-dimensional multiple-bin-size bin packing problems (Q2260892) (← links)
• Constructive heuristics for the canister filling problem (Q2276059) (← links)
• Scheduling non-preemptible jobs to minimize peak demand (Q2633192) (← links)
• The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview (Q2669629) (← links)
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
• Upper bounds for heuristic approaches to the strip packing problem (Q2803257) (← links)
• An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling (Q2942377) (← links)
• A hybrid estimation of distribution algorithm for the offline 2D variable-sized bin packing problem (Q6536478) (← links)