Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme

DOI10.1080/02331938808843374zbMath0651.90042OpenAlexW2064504917WikidataQ57634039 ScholiaQ57634039MaRDI QIDQ3796954

Frank Werner

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938808843374

zbMATH Keywords

approximation methodslocal searchsequencingHamiltonian graphsdetermination of a suitable neighbourhoodneighbourhood graphspermutations of m elements

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items

On the combinatorial structure of the permutation flow shop problem ⋮ Some relations between neighbourhood graphs for a permutation problem ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ Insertion techniques for the heuristic solution of the job shop problem

Cites Work

• On the Assignment Polytope
• An Evaluation of Flow Shop Sequencing Heuristics
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Unnamed Item