Scheduling in flowshops to minimize total tardiness of jobs

DOI10.1080/00207540310001657595zbMath1059.90070OpenAlexW2067949393MaRDI QIDQ4671257

Sameer Hasija, Chandrasekharan Rajendran

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540310001657595

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (15)

NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness ⋮ Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion

Cites Work

• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A new heuristic method for the flow shop sequencing problem
• Modified simulated annealing algorithms for the flow shop sequencing problem
• A fast tabu search algorithm for the permutation flow-shop problem
• A tabu search approach for the flow shop scheduling problem
• Tabu search for total tardiness minimization in flowshop scheduling problems
• Heuristics for scheduling in flowshop with multiple objectives
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Flowshop sequencing problems with limited buffer storage
• An Evaluation of Flow Shop Sequencing Heuristics
• Sequencing CONWIP flow-shops: Analysis and heuristics
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

This page was built for publication: Scheduling in flowshops to minimize total tardiness of jobs