On the heuristic solution of the permutation flow shop problem by path algorithms
From MaRDI portal
Publication:690012
DOI10.1016/0305-0548(93)90058-QzbMath0793.90030WikidataQ57634029 ScholiaQ57634029MaRDI QIDQ690012
Publication date: 18 August 1994
Published in: Computers \& Operations Research (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (13)
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion ⋮ A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Heuristics for permutation flow shop scheduling with batch setup times ⋮ A fast tabu search algorithm for the permutation flow-shop problem ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Some aspects of scatter search in the flow-shop problem ⋮ A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
Cites Work
- Unnamed Item
- Unnamed Item
- A block approach for single-machine scheduling with release dates and due dates
- A new heuristic method for the flow shop sequencing problem
- Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems
- Benchmarks for basic scheduling problems
- Optimal two- and three-stage production schedules with setup times included
- A survey and evaluation of static flowshop scheduling heuristics
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- A concise survey of efficiently solvable special cases of the permutation flow-shop problem
- Zu einigen Nachbarschaftsstrukturen fiir Iterationsverfahren zur naherangsweisen Lösung spezieller Reihenfolgeprohleme
- On the combinatorial structure of the permutation flow shop problem
- Some relations between neighbourhood graphs for a permutation problem
- Tabu Search—Part I
- Tabu Search—Part II
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- An Evaluation of Flow Shop Sequencing Heuristics
- Heuristic-Programming Solution of a Flowshop-Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
This page was built for publication: On the heuristic solution of the permutation flow shop problem by path algorithms
