An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times

DOI10.1007/S10288-023-00535-7MaRDI QIDQ6489312

Marcelo Seido Nagano, Unnamed Author

Publication date: 21 April 2024

Published in: 4OR (Search for Journal in Brave)

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis

Cites Work

• Unnamed Item
• Total completion time with makespan constraint in no-wait flowshops with setup times
• NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
• A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• Order scheduling with tardiness objective: improved approximate solutions
• A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
• An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects
• Heuristics for no-wait flowshops with makespan subject to mean completion time
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
• Benchmarks for basic scheduling problems
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
• Minimizing total tardiness in no-wait flowshops
• Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates
• Scheduling

This page was built for publication: An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times