On the combinatorial structure of the permutation flow shop problem
DOI10.1007/BF01417515zbMATH Open0743.90069DBLPjournals/mmor/Werner91OpenAlexW2091423096WikidataQ57634034 ScholiaQ57634034MaRDI QIDQ3978451FDOQ3978451
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
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
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
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
- Title not available (Why is that?)
- Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- Title not available (Why is that?)
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)
