Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
From MaRDI portal
Publication:711284
DOI10.1016/j.amc.2010.05.089zbMath1197.90218OpenAlexW1977132897MaRDI QIDQ711284
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
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic ⋮ Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
- Minimizing total tardiness in permutation flowshops
- A note on hashing functions and tabu search algorithms
- A new constructive heuristic for the flowshop scheduling problem
- Tabu search for total tardiness minimization in flowshop scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- A user's guide to tabu search
- An Improved Formulation for the Job-Shop Scheduling Problem
- A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
- On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem
- Scheduling in flowshops to minimize total tardiness of jobs
- Comparative evaluation of MILP flowshop models
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Minimizing tardiness in a two-machine flow-shop
