A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
From MaRDI portal
Publication:2901027
DOI10.1287/ijoc.1070.0258zbMath1243.90069OpenAlexW2108926148MaRDI QIDQ2901027
Rubén Ruiz, Gerardo Minella, Michele Ciavotta
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0258
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (30)
Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm ⋮ An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem ⋮ Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools ⋮ A high performing metaheuristic for multi-objective flowshop scheduling problem ⋮ A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem ⋮ A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling ⋮ Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization ⋮ Speeding up local search for the insert neighborhood in the weighted tardiness permutation flowshop problem ⋮ Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ Flow shop scheduling under Time-Of-Use electricity tariffs using fuzzy multi-objective linear programming approach ⋮ An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Evaluating the impact of grammar complexity in automatic algorithm design ⋮ Improving the anytime behavior of two-phase local search ⋮ Literature reviews in operations research: a new taxonomy and a meta review ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ A self-guided genetic algorithm for permutation flowshop scheduling problems ⋮ Multi-objective metaheuristic algorithms for the resource-constrained project scheduling problem with precedence relations ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ A parallel multiple reference point approach for multi-objective optimization ⋮ The hybrid flow shop scheduling problem ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ The evolution of schematic representations of flow shop scheduling problems ⋮ Domination Measure: A New Metric for Solving Multiobjective Optimization ⋮ The distributed permutation flowshop scheduling problem
Uses Software
This page was built for publication: A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
