Minimizing total tardiness in no-wait flowshops

DOI10.2478/V10209-011-0009-6zbMATH Open1360.90119OpenAlexW2043557499MaRDI QIDQ2978428FDOQ2978428

Tariq Aldowaisan, Ali Allahverdi

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

Recommendations

• Minimizing total tardiness in permutation flowshops
• Some heuristics for no-wait flowshops with total tardiness criterion
• Stochastically minimizing total flowtime in flowshops with no waiting space
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
• A note on minimizing maximum lateness in a two-machine no-wait flowshop
• Scheduling in flowshops to minimize total tardiness of jobs
• Some effective heuristics for no-wait flowshops with setup times to minimize total completion time
• Minimizing total completion time in a no-wait flowshop with sequence-dependent additive changeover times
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan

zbMATH Keywords

schedulingtotal tardinessflowshopno-wait

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

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

Cited In (18)

• An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
• Scheduling in flowshops to minimize total tardiness of jobs
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• New heuristics for no-wait flowshops to minimize makespan.
• A note on minimizing maximum lateness in a two-machine no-wait flowshop
• On the exact solution of the no-wait flow shop problem with due date constraints
• 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
• COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
• An improved water wave optimization algorithm with the single wave mechanism for the no-wait flow-shop scheduling problem
• Minimizing total tardiness in permutation flowshops
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
• On Eulerian extensions and their application to no-wait flowshop scheduling
• Minimizing total flow time and total completion time with immediate dispatching
• 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: Minimizing total tardiness in no-wait flowshops

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