A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
From MaRDI portal
Publication:3498886
DOI10.1080/00207540600988105zbMath1141.90415OpenAlexW2091642568MaRDI QIDQ3498886
Li-Feng Xi, Binghai Zhou, Shijin Wang
Publication date: 19 May 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540600988105
Related Items (7)
A priority-based genetic algorithm for a flexible job shop scheduling problem ⋮ A variable neighbourhood search algorithm for the flexible job-shop scheduling problem ⋮ List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility ⋮ An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria ⋮ A research survey: review of flexible job shop scheduling techniques ⋮ 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 ⋮ A Taxonomy for the Flexible Job Shop Scheduling Problem
Cites Work
- The job shop scheduling problem: Conventional and new solution techniques
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- Makespan estimation and order acceptance in batch process industries when processing times are uncertain
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- The Complexity of Flowshop and Jobshop Scheduling
- The classification of FMS scheduling problems
- A study of scheduling rules of flexible manufacturing systems: A simulation approach
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- Reactive scheduling in a dynamic and stochastic FMS environment
This page was built for publication: A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem