List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
From MaRDI portal
Publication:320008
DOI10.1016/j.ejor.2015.06.023zbMath1346.90328OpenAlexW2198739890MaRDI QIDQ320008
J. E. Ferreira, Ernesto G. Birgin, Débora P. Ronconi
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.06.023
Related Items (5)
Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem ⋮ Step cost functions in a fleet size and mix vehicle routing problem with time windows ⋮ Metaheuristics for the online printing shop scheduling problem ⋮ The risk-averse traveling repairman problem with profits ⋮ 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
- Unnamed Item
- An integrated search heuristic for large-scale flexible job shop scheduling problems
- An effective architecture for learning and evolving flexible job-shop schedules
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- A heuristic to schedule flexible job-shop in a glass factory
- Job shop scheduling with beam search
- Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
- A backward approach in list scheduling algorithms for multi-machine tardiness problems
- New heuristics for total tardiness minimization in a flexible flowshop
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem
- A MILP model for an extended version of the flexible job shop problem
- A genetic algorithm for the flexible job-shop scheduling problem
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
- Bottleneck-focused scheduling for a hybrid flowshop
- Metaheuristics—the metaphor exposed
- Scheduling
This page was built for publication: List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility
