Minimizing total tardiness in no-wait flowshops

DOI10.2478/V10209-011-0009-6zbMath1360.90119OpenAlexW2043557499MaRDI QIDQ2978428

Ali Allahverdi, Tariq A. Aldowaisan

Publication date: 25 April 2017

Published in: Foundations of Computing and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://www.degruyter.com/view/j/fcds.2012.37.issue-3/v10209-011-0009-6/v10209-011-0009-6.xml?format=INT

zbMATH Keywords

schedulingflowshopno-waittotal tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (8)

An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem ⋮ On the exact solution of the no-wait flow shop problem with due date constraints ⋮ No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ No-wait flowshop scheduling problem with two criteria; total tardiness and makespan ⋮ A survey of scheduling problems with no-wait in process ⋮ An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times ⋮ No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan

Cites Work

• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• New heuristics for no-wait flowshops to minimize makespan.
• A survey of scheduling problems with setup times or costs
• A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• No-wait flowshops with bicriteria of makespan and total completion time
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: Minimizing total tardiness in no-wait flowshops