A two-machine flowshop scheduling problem with precedence constraint on two jobs
From MaRDI portal
Publication:1701710
DOI10.1007/s00500-015-1908-xzbMath1381.90037MaRDI QIDQ1701710
Jun Liu, Yunqiang Yin, Win-Chin Lin, Chih-Hou Wen, Chin-Chia Wu, Shuenn-Ren Cheng
Publication date: 27 February 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-015-1908-x
90B35: Deterministic scheduling theory in operations research
Cites Work
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Two-machine flow shop total tardiness scheduling problem with deteriorating jobs
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A dual algorithm for the one-machine scheduling problem
- A Survey of Scheduling Rules
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Two-machine flowshop scheduling to minimize total tardiness