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

DOI10.1007/S00291-007-0098-ZMaRDI QIDQ991843zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

schedulingiterated local searchflowshopmultiobjective optimisation

Mathematics Subject Classification ID

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

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

Cites work

• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem
• A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
• A partial enumeration heuristic for multi-objective flowshop scheduling problems
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem
• Benchmarks for basic scheduling problems
• Efficiency of interactive multi-objective simulated annealing through a case study
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• Heuristics for scheduling in flowshop with multiple objectives
• Multiobjective scheduling by genetic algorithms.
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization

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

Describes a project that uses

Uses Software

• OR-Library

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)