Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
From MaRDI portal
Publication:2426522
DOI10.1016/j.ejor.2007.02.024zbMath1149.90130OpenAlexW1992996763MaRDI QIDQ2426522
Yasin Gocgun, Erdal Erel, Ịhsan Sabuncuoğlu
Publication date: 22 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/23133
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (11)
An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal ⋮ A decomposition approach for the car resequencing problem with selectivity banks ⋮ Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration ⋮ Truck scheduling in cross-docking terminals with fixed outbound departures ⋮ On the part inventory model sequencing problem: complexity and beam search heuristic ⋮ An exact solution approach for scheduling cooperative gantry cranes ⋮ Level scheduling under limited resequencing flexibility ⋮ Level scheduling for batched JIT supply ⋮ GRASP with path relinking for a multiple objective sequencing problem for a mixed-model assembly line ⋮ Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
Cites Work
- Unnamed Item
- Heuristics and exact algorithms for solving the Monden problem
- Using beam search techniques for sequencing mixed-model assembly lines
- A beam search algorithm for the load sequencing of outbound containers in port container terminals
- A fuzzy project scheduling approach to minimize schedule risk for product development
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Job shop scheduling with beam search
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Scheduling sports competitions at multiple venues -- revisited
- Breadth-first heuristic search
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- Word Reordering and a Dynamic Programming Beam Search Algorithm for Statistical Machine Translation
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Improved lower bounds for the early/tardy scheduling problem with no idle time
- Stochastic assembly line balancing using beam search
- Analysis of reactive scheduling problems in a job shop environment
- A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study
This page was built for publication: Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
