Modified simulated annealing algorithms for the flow shop sequencing problem
From MaRDI portal
Publication:1129912
DOI10.1016/0377-2217(93)E0235-PzbMath0927.90048OpenAlexW2014933665MaRDI QIDQ1129912
Hisao Ishibuchi, Shinta Misaki, Hideo Tanaka
Publication date: 16 August 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(93)e0235-p
Related Items (26)
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion ⋮ Integrated cost optimization in a two-stage, automotive supply chain ⋮ Metaheuristics: A bibliography ⋮ Two-machine flow shop problems with a single server ⋮ Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. ⋮ A unified framework for population-based metaheuristics ⋮ Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. ⋮ Revisiting simulated annealing: a component-based analysis ⋮ An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs ⋮ Minimizing makespan on an \(m\)-machine re-entrant flowshop ⋮ Parameter identification for a nonlinear enzyme-catalytic dynamic system with time-delays ⋮ Synergy of genetic algorithm with extensive neighborhood search for the permutation flowshop scheduling problem ⋮ A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ A comprehensive review and evaluation of permutation flowshop heuristics ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ An improved genetic algorithm for the flowshop scheduling problem ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Genetic algorithms and simulated annealing for scheduling in agile manufacturing ⋮ A time-dependent hierarchical Chinese postman problem ⋮ A hybrid genetic local search algorithm for the permutation flowshop scheduling problem ⋮ An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs ⋮ A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs ⋮ Some results of the worst-case analysis for flow shop scheduling ⋮ Some aspects of scatter search in the flow-shop problem ⋮ A comparative study of dispatching rules in dynamic flowshops and jobshops
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Some efficient heuristic methods for the flow shop sequencing problem
- A new heuristic method for the flow shop sequencing problem
- Optimal two- and three-stage production schedules with setup times included
- Convergence of an annealing algorithm
- The Lessons of Flowshop Scheduling Research
- An Evaluation of Flow Shop Sequencing Heuristics
This page was built for publication: Modified simulated annealing algorithms for the flow shop sequencing problem
