Some heuristics for no-wait flowshops with total tardiness criterion

DOI10.1016/J.COR.2012.07.019MaRDI QIDQ340249zbMATH OpenOpenAlexFDO

Authors Gengcheng Liu, Cheng Wu, 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)

Recommendations

• Minimizing total tardiness in no-wait flowshops
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan
• Heuristics for no-wait flowshops with makespan subject to mean completion time

Cited in

(14)

• A survey of scheduling problems with no-wait in process
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis
• A new heuristic and dominance relations for no-wait flowshops with setups
• A systematic review of permutation flow shop scheduling with due-date-related objectives
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
• scientific article; zbMATH DE number 1859345 (Why is no real title available?)
• Flow shop scheduling problem with position-dependent processing times
• On the exact solution of the no-wait flow shop problem with due date constraints
• A Q-learning-based variable greedy algorithm to minimize the sum of total earliness and tardiness in a no-wait flowshop scheduling problem
• 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

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)