Pages that link to "Item:Q1302706"
From MaRDI portal
The following pages link to Applications of modern heuristic search methods to pattern sequencing problems (Q1302706):
Displayed 15 items.
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← links)
- On the one-dimensional stock cutting problem in the paper tube industry (Q640306) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners (Q835826) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- Solving the continuous flow-shop scheduling problem by metaheuristics. (Q1410624) (← links)
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499) (← links)
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines (Q1941954) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais (Q3621505) (← links)
- Minimization of open orders: application of a re-distribution coordination policy (Q4823570) (← links)
- Mathematical models for the minimization of open stacks problem (Q6082193) (← links)