A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
From MaRDI portal
Publication:2432854
DOI10.1016/j.ejor.2005.04.038zbMath1137.90484OpenAlexW2133863446MaRDI QIDQ2432854
Hansen Khoo, F. Choobineh, Esmail Mohebbi
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.038
Related Items (6)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness ⋮ A GRASP based on DE to solve single machine scheduling problem with SDST ⋮ A multi-objective quantity discount and joint optimization model for coordination of a single-buyer multi-vendor supply chain ⋮ Redesign of production flow lines to postpone product differentiation ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
Uses Software
Cites Work
- Unnamed Item
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Scheduling in a sequence dependent setup environment with genetic search
- Genetic algorithms and tabu search: Hybrids for optimization
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Solving the continuous flow-shop scheduling problem by metaheuristics.
- A new multiobjective evolutionary algorithm
- Future paths for integer programming and links to artificial intelligence
- A comparison of neighborhood search techniques for multi-objective combinatorial problems
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
- Tabu Search—Part I
- Tabu Search—Part II
- One machine sequencing to minimize mean flow time with minimum number tardy
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times
- MOSA method: a tool for solving multiobjective combinatorial optimization problems
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
