Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
From MaRDI portal
Publication:336334
DOI10.1016/j.cor.2011.08.009zbMath1348.90639OpenAlexW2083529397MaRDI QIDQ336334
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Optimizing of bullwhip effect and net stock amplification in three-echelon supply chains using evolutionary multi-objective metaheuristics ⋮ Multiobjective pseudo‐variable neighborhood descent for a bicriteria parallel machine scheduling problem with setup time ⋮ Multiobjective optimization for complex flexible job-shop scheduling problems ⋮ Using a variable neighborhood search to solve a bi-objective identical parallel machine scheduling problem
Cites Work
- An exact parallel method for a bi-objective permutation flowshop problem
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
- An ant colony system for permutation flow-shop sequencing
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
- 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
- Multicriteria scheduling problems: a survey
- A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Unnamed Item
This page was built for publication: Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
