On the combinatorial structure of the permutation flow shop problem

DOI10.1007/BF01417515MaRDI QIDQ3978451zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Frank Werner

Publication date 25 June 1992

Published in 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)

Recommendations

• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• A note on permutation flow shop problem
• On some lower bounds for the permutation flowshop problem
• scientific article; zbMATH DE number 502872
• A computational study of the permutation flow shop problem based on a tight lower bound
• A new integer programming formulation for the permutation flowshop problem
• Tight Bounds for Permutation Flow Shop Scheduling
• Tight bounds for permutation flow shop scheduling
• Two branch and bound algorithms for the permutation flow shop problem
• Permutation, no-wait, no-idle flow shop problems

Cites work

• scientific article; zbMATH DE number 3839671 (Why is no real title available?)
• scientific article; zbMATH DE number 4020829 (Why is no real title available?)
• A survey and evaluation of static flowshop scheduling heuristics
• An Evaluation of Flow Shop Sequencing Heuristics
• Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme

Cited in

(7)

• On the heuristic solution of the permutation flow shop problem by path algorithms
• Permutation-induced acyclic networks for the job shop scheduling problem
• New block properties for the permutation flow shop problem with application in tabu search
• scientific article; zbMATH DE number 4089300 (Why is no real title available?)
• Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
• A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
• scientific article; zbMATH DE number 3982899 (Why is no real title available?)

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

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