Some heuristics for no-wait flowshops with total tardiness criterion

DOI10.1016/J.COR.2012.07.019zbMATH Open1349.90376OpenAlexW2085594718MaRDI QIDQ340249FDOQ340249

Cheng Wu, Gengcheng Liu, Shiji 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) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Cited In (12)

• A new heuristic and dominance relations for no-wait flowshops with setups
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
• Title not available (Why is that?)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• Flow shop scheduling problem with position-dependent processing times
• 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
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
• New heuristics for total tardiness minimization in a flexible flowshop
• Minimizing total tardiness in no-wait flowshops
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
• A survey of scheduling problems with no-wait in process

This page was built for publication: Some heuristics for no-wait flowshops with total tardiness criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340249)