A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria

DOI10.1007/s00291-007-0098-zzbMath1193.90099OpenAlexW2075498507MaRDI QIDQ991843

Rainer Leisten, Jose M. Framinan

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

zbMATH Keywords

schedulingflowshopmultiobjective optimisationiterated local search

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35)

Related Items

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 ⋮ Multi-directional local search ⋮ Population-based iterated greedy algorithm for the S-labeling problem ⋮ Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem ⋮ Iterated greedy for the maximum diversity problem ⋮ Bi-objective parallel machine scheduling with additional resources during setups

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• A simple and effective iterated greedy algorithm for the permutation 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
• Benchmarks for basic scheduling problems
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• Efficiency of interactive multi-objective simulated annealing through a case study
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• A partial enumeration heuristic for multi-objective flowshop scheduling problems
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem