Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

DOI10.1016/J.AMC.2010.05.089MaRDI QIDQ711284zbMATH OpenOpenAlexFDO

Authors Li-Man Liao, Ching-Jen Huang

Publication date 25 October 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2010.05.089

zbMATH Keywords

schedulingtabu searchtardinessMILP modelnon-permutation flowshop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Recommendations

• Tabu search for total tardiness minimization in flowshop scheduling problems
• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
• Minimizing total tardiness in permutation flowshops
• Hybrid tabu search algorithms for permutation flow shops to minimize total flowtime
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic

Cites work

• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 4093162 (Why is no real title available?)
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• A comprehensive review and evaluation of permutation flowshop heuristics
• A new constructive heuristic for the flowshop scheduling problem
• A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
• A note on hashing functions and tabu search algorithms
• A user's guide to tabu search
• An Improved Formulation for the Job-Shop Scheduling Problem
• Benchmarks for basic scheduling problems
• Comparative evaluation of MILP flowshop models
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
• Minimizing tardiness in a two-machine flow-shop
• Minimizing total tardiness in permutation flowshops
• On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
• Scheduling in flowshops to minimize total tardiness of jobs
• Tabu search for total tardiness minimization in flowshop scheduling problems

Cited in

(8)

• Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
• A tabu search algorithm for a pipe-processing flowshop scheduling problem minimizing total tardiness in a shipyard
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
• Non-permutation flow shop scheduling with order acceptance and weighted tardiness
• A hybrid scheduling approach for a two-stage flexible flow shop with batch processing machines
• MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem
• Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

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