An iterated local search for a re-entrant flow shop scheduling problem

DOI10.1007/978-3-319-28697-6_31zbMATH Open1342.90061OpenAlexW2473338386MaRDI QIDQ2806932FDOQ2806932

Authors: Richard Hinze, Dirk Sackmann 

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_31

Recommendations

• Heuristic algorithms for two machine re-entrant flow shop
• Minimizing makespan in re-entrant permutation flow-shops
• Minimizing makespan on an \(m\)-machine re-entrant flowshop
• Re-entrant flowshop scheduling with learning considerations to minimize the makespan
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion

zbMATH Keywords

heuristiciterated local search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Minimizing makespan in re-entrant permutation flow-shops
• A Review of Production Scheduling

Cited In (4)

• Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• An iterative neighborhood search algorithm for large scale no-wait flow-shop
• A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time

This page was built for publication: An iterated local search for a re-entrant flow shop scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2806932)