Job shop scheduling with beam search
From MaRDI portal
Publication:1806850
DOI10.1016/S0377-2217(98)00319-1zbMath0940.90037MaRDI QIDQ1806850
Publication date: 25 July 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (39)
Multi-agent based beam search for intelligent production planning and scheduling ⋮ An optimisation model and its effective beam search heuristics for floor-storage warehousing systems ⋮ Beam search for the longest common subsequence problem ⋮ On the flexibility of a decision theory-based heuristic for single machine scheduling ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ Order acceptance with weighted tardiness ⋮ A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem ⋮ Solving a large cutting problem in the glass manufacturing industry ⋮ Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling ⋮ A general approach for optimizing regular criteria in the job-shop scheduling problem ⋮ Scatter search with stochastic beam search on the coalition formation 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 ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ A filter-and-fan approach to the job shop scheduling problem ⋮ A beam search approach to solve the convex irregular bin packing problem with guillotine guts ⋮ A beam search algorithm for the circular packing problem ⋮ Analysis of reactive scheduling problems in a job shop environment ⋮ An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling ⋮ A beam search implementation for the irregular shape packing problem ⋮ Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net ⋮ A new hybrid genetic algorithm for job shop scheduling problem ⋮ Beam search heuristic to solve stochastic integer problems under probabilistic constraints ⋮ A hybrid genetic algorithm for the job shop scheduling problem ⋮ On solving the assembly line worker assignment and balancing problem via beam search ⋮ A Petri net based algorithm for minimizing total tardiness in flexible manufacturing systems ⋮ Mixed-model assembly line sequencing using beam search ⋮ Survey on Directed Model Checking ⋮ Job sequencing with one common and multiple secondary resources: an A*/beam search based anytime algorithm ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ Anytime pack search ⋮ An exact solution method for the capacitated item-sharing and crowdshipping problem ⋮ An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition ⋮ New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs ⋮ Bicriteria train scheduling for high-speed passenger railroad planning applications ⋮ 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
Cites Work
- A neural network model for scheduling problems
- Deterministic job-shop scheduling: Past, present and future
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- Tabu Search—Part I
- Tabu Search—Part II
- A Computational Study of the Job-Shop Scheduling Problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Job shop scheduling with beam search
