A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
From MaRDI portal
Publication:991843
DOI10.1007/S00291-007-0098-ZzbMATH Open1193.90099OpenAlexW2075498507MaRDI QIDQ991843FDOQ991843
Authors: Jose M. Framinan, Rainer Leisten 
Publication date: 8 September 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-007-0098-z
Recommendations
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Benchmarks for basic scheduling problems
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Efficiency of interactive multi-objective simulated annealing through a case study
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
- Heuristics for scheduling in flowshop with multiple objectives
- An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- Multiobjective scheduling by genetic algorithms.
- A partial enumeration heuristic for multi-objective flowshop scheduling problems
Cited In (12)
- Iterated greedy for the maximum diversity problem
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
- Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
- Population-based iterated greedy algorithm for the S-labeling problem
- Bi-objective parallel machine scheduling with additional resources during setups
- Multi-directional local search
- Carbon-efficient scheduling of flow shops by multi-objective optimization
- Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- A machine-learning based memetic algorithm for the multi-objective permutation flowshop scheduling problem
- Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem
Uses Software
This page was built for publication: A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991843)
