On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57634029, #quickstatements; #temporary_batch_1705826305579
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3763883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic-Programming Solution of a Flowshop-Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3778531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorial structure of the permutation flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey and evaluation of static flowshop scheduling heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some relations between neighbourhood graphs for a permutation problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:45, 22 May 2024

scientific article
Language Label Description Also known as
English
On the heuristic solution of the permutation flow shop problem by path algorithms
scientific article

    Statements

    On the heuristic solution of the permutation flow shop problem by path algorithms (English)
    0 references
    0 references
    18 August 1994
    0 references
    permutation flow shop problem
    0 references
    NP-hard
    0 references
    shift graph
    0 references

    Identifiers