The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
From MaRDI portal
Publication:909574
DOI10.1016/0305-0548(90)90001-NzbMath0694.90059OpenAlexW2037524044MaRDI QIDQ909574
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90001-n
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (61)
A note on worst-case analysis of approximation algorithms for a scheduling problem ⋮ Routing and scheduling in a flexible job shop by tabu search ⋮ A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion ⋮ A neuro-tabu search heuristic for the flow shop scheduling problem ⋮ Unrelated parallel machine scheduling using local search ⋮ An effective differential evolution algorithm for permutation flow shop scheduling problem ⋮ A genetic algorithm for flowshop sequencing ⋮ A real-time order acceptance and scheduling approach for permutation flow shop problems ⋮ A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Two-machine flow shop problems with a single server ⋮ Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge ⋮ Modified simulated annealing algorithms for the flow shop sequencing problem ⋮ Flowshop sequencing with mean flowtime objective ⋮ A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems ⋮ Heuristics for scheduling in flowshop with multiple objectives ⋮ A systematic procedure for setting parameters in simulated annealing algorithms ⋮ Heuristic procedures for minimizing makespan and the number of required pallets ⋮ Minimizing grid capacity in preemptive electric vehicle charging orchestration: complexity, exact and heuristic approaches ⋮ A composite heuristic for the single machine early/tardy job scheduling problem. ⋮ Improved genetic algorithm for the permutation flowshop scheduling problem. ⋮ Optimisation of a Simulated‐Annealing‐based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm ⋮ Revisiting simulated annealing: a component-based analysis ⋮ Simulated annealing algorithm for solving the single machine early/tardy problem ⋮ Minimizing makespan on an \(m\)-machine re-entrant flowshop ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm ⋮ Parallel hybrid heuristics for the permutation flow shop problem ⋮ DLSP for two-stage multi-item batch production ⋮ Determining the number of kanbans and lotsizes in a generic kanban system: a simulated annealing approach ⋮ A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria ⋮ A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs ⋮ A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ An improved genetic algorithm for the flowshop scheduling problem ⋮ Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs ⋮ Supercomputer Scheduling with Combined Evolutionary Techniques ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling ⋮ Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process ⋮ A fast tabu search algorithm for the permutation flow-shop problem ⋮ An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs ⋮ Fuzzy sets and operations research: Perspectives ⋮ A new constructive heuristic for the flowshop scheduling problem ⋮ A note of using effective immune based approach for the flow shop scheduling with buffers ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ A tabu search approach for the flow shop scheduling problem ⋮ Some aspects of scatter search in the flow-shop problem ⋮ Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach ⋮ Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism ⋮ Some experiments with simulated annealing techniques for packing problems ⋮ Simulated annealing for resource-constrained scheduling ⋮ Scheduling flow shops using differential evolution algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Structural analysis of local search heuristics in combinatorial optimization
- Optimal two- and three-stage production schedules with setup times included
- Convergence of an annealing algorithm
- Simulated annealing methods with general acceptance probabilities
- On general routing problems
- An Evaluation of Flow Shop Sequencing Heuristics
- Equation of State Calculations by Fast Computing Machines
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
This page was built for publication: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
