Job shop scheduling with beam search
From MaRDI portal
Publication:1806850
DOI10.1016/S0377-2217(98)00319-1zbMATH Open0940.90037MaRDI QIDQ1806850FDOQ1806850
Publication date: 25 July 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- Job Shop Scheduling by Local Search
- A recovering beam search algorithm for the single machine just-in-time scheduling problem
- A search space analysis of the job shop scheduling problem
- Job Shop Scheduling by Simulated Annealing
- Problem and Heuristic Space Search Strategies for Job Shop Scheduling
Cites Work
- A Computational Study of the Job-Shop Scheduling Problem
- Title not available (Why is that?)
- Tabu Search—Part I
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Title not available (Why is that?)
- Tabu Search—Part II
- Deterministic job-shop scheduling: Past, present and future
- Title not available (Why is that?)
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A neural network model for scheduling problems
Cited In (44)
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net
- Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling
- A filtered beam search based heuristic algorithm for packing unit circles into a circular container
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- Survey on Directed Model Checking
- Scatter search with stochastic beam search on the coalition formation problem
- A beam search implementation for the irregular shape packing problem
- Title not available (Why is that?)
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Anytime pack search
- Hybrid rollout approaches for the job shop scheduling problem
- Beam search for the longest common subsequence problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A new hybrid genetic algorithm for job shop scheduling problem
- Beam search heuristic to solve stochastic integer problems under probabilistic constraints
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- Mixed-model assembly line sequencing using beam search
- Pruning State Spaces with Extended Beam Search
- Solving a large cutting problem in the glass manufacturing industry
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs
- An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
- Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm
- An exact solution method for the capacitated item-sharing and crowdshipping problem
- A Petri net based algorithm for minimizing total tardiness in flexible manufacturing systems
- Order acceptance with weighted tardiness
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Analysis of reactive scheduling problems in a job shop environment
- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition
- An iterated beam search algorithm for the multi-level production smoothing problem with workload smoothing goal
- Multi-agent based beam search for intelligent production planning and scheduling
- A beam search algorithm for the circular packing problem
- On solving the assembly line worker assignment and balancing problem via beam search
- Ejection chain and filter-and-fan methods in combinatorial optimization
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
- Deterministic job-shop scheduling: Past, present and future
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- A filter-and-fan approach to the job shop scheduling problem
- Extended beam search for non-exhaustive state space analysis
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
- A hybrid genetic algorithm for the job shop scheduling problem
- An optimisation model and its effective beam search heuristics for floor-storage warehousing systems
- Bicriteria train scheduling for high-speed passenger railroad planning applications
This page was built for publication: Job shop scheduling with beam search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806850)
