An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
From MaRDI portal
Publication:2003434
DOI10.1016/j.cor.2019.04.012zbMath1458.90294OpenAlexW2938448575WikidataQ128076005 ScholiaQ128076005MaRDI QIDQ2003434
Stéphane Dauzère-Pérès, Yazid Mati, Andrés Alberto García-León
Publication date: 8 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2019.04.012
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Related Items (6)
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Flexible job-shop scheduling with transportation resources ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ Efficient multi-objective metaheuristic algorithm for sustainable harvest planning problem ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ Integrating preferences within multiobjective flexible job shop scheduling
Uses Software
Cites Work
- Unnamed Item
- Scatter search with path relinking for the flexible job shop scheduling problem
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
- A general approach for optimizing regular criteria in the job-shop scheduling problem
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective
- Multi-resource shop scheduling with resource flexibility
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems
- A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities
- A novel memetic algorithm based on decomposition for multiobjective flexible job shop scheduling problem
- Routing and scheduling in a flexible job shop by tabu search
- A research survey: review of flexible job shop scheduling techniques
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem
This page was built for publication: An efficient Pareto approach for solving the multi-objective flexible job-shop scheduling problem with regular criteria
