On the combinatorial structure of the permutation flow shop problem

DOI10.1007/BF01417515zbMath0743.90069OpenAlexW2091423096WikidataQ57634034 ScholiaQ57634034MaRDI QIDQ3978451

Frank Werner

Publication date: 25 June 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3199221 ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01417515

zbMATH Keywords

local searchflow shopmaximum completion timeneighbourhood structures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

On the heuristic solution of the permutation flow shop problem by path algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A survey and evaluation of static flowshop scheduling heuristics
• Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
• An Evaluation of Flow Shop Sequencing Heuristics

This page was built for publication: On the combinatorial structure of the permutation flow shop problem