Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
DOI10.1016/J.COR.2011.08.009zbMATH Open1348.90639OpenAlexW2083529397MaRDI QIDQ336334FDOQ336334
Authors: Shih-Wei Lin, Kuo-Ching Ying 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.08.009
Recommendations
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- A genetic algorithm for flowshop scheduling with multiple objectives
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An ant colony system for permutation flow-shop sequencing
- Multicriteria scheduling problems: a survey
- An exact parallel method for a bi-objective permutation flowshop problem
- Benchmarks for basic scheduling problems
- Multicriteria scheduling
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- A review and evaluation of multiobjective algorithms for the flowshop scheduling problem
- Multiobjective scheduling by genetic algorithms.
Cited In (7)
- A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs
- Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time
- Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics
- Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
- Multiobjective optimization for complex flexible job-shop scheduling problems
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
This page was built for publication: Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336334)
