Tabu search for total tardiness minimization in flowshop scheduling problems
From MaRDI portal
Publication:1302584
DOI10.1016/S0305-0548(98)00060-4zbMath0947.90040OpenAlexW2019682546MaRDI QIDQ1302584
Débora P. Ronconi, Vinicius Amaral Armentano
Publication date: 8 November 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(98)00060-4
Related Items
Parallel machines scheduling with machine preference via agent-based approach ⋮ Parallel machine scheduling models with fuzzy processing times ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A biased random key genetic algorithm for the field Technician scheduling problem ⋮ Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ A two-machine flowshop scheduling problem with precedence constraint on two jobs ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness ⋮ Multiple machine JIT scheduling: a tabu search approach ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ Scheduling in flowshops to minimize total tardiness of jobs ⋮ 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 ⋮ Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Genetic local search for multi-objective flowshop scheduling problems
