Some heuristics for no-wait flowshops with total tardiness criterion

DOI10.1016/j.cor.2012.07.019zbMath1349.90376OpenAlexW2085594718MaRDI QIDQ340249

Cheng Wu, Gengcheng Liu, Shi-ji Song

Publication date: 14 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.019

zbMATH Keywords

heuristictotal tardinessno-wait flowshop

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

On the exact solution of the no-wait flow shop problem with due date constraints, No-wait flowshop scheduling problem with two criteria; total tardiness and makespan, A survey of scheduling problems with no-wait in process, Flow shop scheduling problem with position-dependent processing times, No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan