Pages that link to "Item:Q1772848"
From MaRDI portal
The following pages link to Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach (Q1772848):
Displaying 27 items.
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- Practical solutions for a dock assignment problem with trailer transportation (Q319870) (← links)
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268) (← links)
- Mixed integer programming model for scheduling in unrelated parallel processor system with priority consideration (Q478929) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- On solving the assembly line worker assignment and balancing problem via beam search (Q709148) (← links)
- Beam search for the longest common subsequence problem (Q833536) (← links)
- Search tree based approaches for parallel machine scheduling (Q941538) (← links)
- A beam search implementation for the irregular shape packing problem (Q964846) (← links)
- Iterated greedy local search methods for unrelated parallel machine scheduling (Q992577) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times (Q1652061) (← links)
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources (Q1753460) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems (Q1826491) (← links)
- Exact makespan minimization of unrelated parallel machines (Q2165594) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling (Q2426522) (← links)
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
- Capacity allocation problem in flexible manufacturing systems: branch and bound based approaches (Q3055267) (← links)
- An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal (Q3163160) (← links)
- BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS (Q3392290) (← links)
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem (Q4656749) (← links)
- A makespan minimization problem for versatile developers in the game industry (Q6186551) (← links)
