A filter-and-fan approach to the job shop scheduling problem
From MaRDI portal
Publication:958547
DOI10.1016/j.ejor.2007.12.035zbMath1162.90016OpenAlexW2058578326MaRDI QIDQ958547
Publication date: 5 December 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.12.035
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (7)
Solving the job-shop scheduling problem optimally by dynamic programming ⋮ A filter-and-fan approach with adaptive neighborhood switching for resource-constrained project scheduling ⋮ Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ Ejection chain and filter-and-fan methods in combinatorial optimization ⋮ Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending the shifting bottleneck procedure to real-life applications
- A computational study of constraint satisfaction for multiple capacitated job shop scheduling
- Relaxed tours and path ejections for the traveling salesman problem
- Job shop scheduling with beam search
- A hybrid genetic algorithm for the job shop scheduling problem
- A simple filter-and-fan approach to the facility location problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- A Subpath Ejection Method for the Vehicle Routing Problem
- An Ejection Chain Approach for the Generalized Assignment Problem
- Subgraph ejection chains and tabu search for the crew scheduling problem
- Planning and Scheduling in Manufacturing and Services
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- A Computational Study of the Job-Shop Scheduling Problem
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Job Shop Scheduling by Local Search
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
This page was built for publication: A filter-and-fan approach to the job shop scheduling problem
