Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
From MaRDI portal
Publication:1127153
DOI10.1016/0377-2217(94)00021-4zbMath0912.90185OpenAlexW1969513029MaRDI QIDQ1127153
Takao Enkawa, Seyed Hessameddin Zegordi, Kenji Itoh
Publication date: 5 November 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00021-4
Related Items (12)
Metaheuristics: A bibliography ⋮ Two-machine flow shop problems with a single server ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ 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 ⋮ Formulating and solving production planning problems ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing
Cites Work
- Optimization by Simulated Annealing
- On the heuristic solution of the permutation flow shop problem by path algorithms
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Simulated annealing: A tool for operational research
- Some efficient heuristic methods for the flow shop sequencing problem
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Optimal two- and three-stage production schedules with setup times included
- Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
- Convergence of an annealing algorithm
- Using simulated annealing to solve routing and location problems
- Applying Stochastic Algorithms to a Locomotive Scheduling Problem
- Simulated Annealing – An Annotated Bibliography
- Tabu Search—Part I
- General Purpose Simulated Annealing
- Tabu Search—Part II
- Flowshop and Jobshop Schedules: Complexity and Approximation
- An Evaluation of Flow Shop Sequencing Heuristics
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
- Equation of State Calculations by Fast Computing Machines
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
This page was built for publication: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
