Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
From MaRDI portal
Publication:1652198
DOI10.1016/J.COR.2016.11.021zbMath1391.90328OpenAlexW2552076416MaRDI QIDQ1652198
Muh-Cherng Wu, Chi-Shiuan Lin, Chen-Fu Chen, Chia-Hui Lin
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.11.021
Mixed integer programming (90C11) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
A survey of job shop scheduling problem: the types and models ⋮ The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm
Cites Work
- Scatter search with path relinking for the flexible job shop scheduling problem
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Evaluation of mathematical models for flexible job-shop scheduling problems
- An improved genetic algorithm for the distributed and flexible job-shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- A generalized permutation approach to job shop scheduling with genetic algorithms
- Effective neighbourhood functions for the flexible job shop problem
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- The Complexity of Flowshop and Jobshop Scheduling
This page was built for publication: Effects of different chromosome representations in developing genetic algorithms to solve DFJS scheduling problems
