Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
From MaRDI portal
Publication:1127153
Recommendations
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
- Modified simulated annealing algorithms for the flow shop sequencing problem
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- scientific article; zbMATH DE number 2086794
- Job Shop Scheduling by Simulated Annealing
Cites work
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- An Evaluation of Flow Shop Sequencing Heuristics
- An improved annealing scheme for the QAP
- Applying Stochastic Algorithms to a Locomotive Scheduling Problem
- Convergence of an annealing algorithm
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Equation of state calculations by fast computing machines
- Flowshop and Jobshop Schedules: Complexity and Approximation
- General Purpose Simulated Annealing
- Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- On the heuristic solution of the permutation flow shop problem by path algorithms
- Optimal two- and three-stage production schedules with set-up time included
- Optimization by simulated annealing
- SIMULATED ANNEALING SCHEME INCORPORATING MOVE DESIRABILITY TABLE FOR SOLUTION OF FACILITY LAYOUT PROBLEMS
- Simulated Annealing – An Annotated Bibliography
- Simulated annealing: A tool for operational research
- Some efficient heuristic methods for the flow shop sequencing problem
- Tabu Search—Part I
- Tabu Search—Part II
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Using simulated annealing to solve routing and location problems
Cited in
(19)- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- Simulated annealing and imperialist competitive algorithm for minimising makespan in an open shop
- Genetic algorithms and simulated annealing for scheduling in agile manufacturing
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
- Flowshop-scheduling problems with makespan criterion: a review
- Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Metaheuristics: A bibliography
- Two-machine flow shop problems with a single server
- A new lower bounding rule for permutation flow shop scheduling
- A comprehensive review and evaluation of permutation flowshop heuristics
- Using simulated annealing to schedule a flowshop manufacturing cell with sequence-dependent family setup times
- Formulating and solving production planning problems
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- The convergence of stochastic algorithms solving flow shop scheduling
- scientific article; zbMATH DE number 2086794 (Why is no real title available?)
- Case study on statistically estimating minimum makespan for flow line scheduling problems.
This page was built for publication: Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127153)
