Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
From MaRDI portal
Publication:3605449
DOI10.1080/00207540701418960zbMath1154.90361OpenAlexW1974172836MaRDI QIDQ3605449
Rainer Leisten, Jose M. Framinan
Publication date: 24 February 2009
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540701418960
Related Items (21)
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ Metaheuristics for the single machine weighted quadratic tardiness scheduling problem ⋮ Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study ⋮ A beam-search-based constructive heuristic for the PFSP to minimise total flowtime ⋮ A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion ⋮ Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness ⋮ Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion ⋮ Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ Minimizing total tardiness in no-wait flowshops ⋮ A variable iterated greedy algorithm for the traveling salesman problem with time windows ⋮ Setting a common due date in a constrained flowshop: a variable neighbourhood search approach ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm ⋮ Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling ⋮ Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics ⋮ Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
Cites Work
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Benchmarks for shop scheduling problems
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Variable neighborhood search
- Approximative procedures for no-wait job shop scheduling.
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- Scheduling in flowshops to minimize total tardiness of jobs
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Flowshop-scheduling problems with makespan criterion: a review
- Variable neighborhood search: Principles and applications
This page was built for publication: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
