Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
From MaRDI portal
Publication:3605449
DOI10.1080/00207540701418960zbMATH Open1154.90361OpenAlexW1974172836MaRDI QIDQ3605449FDOQ3605449
Authors: Jose M. Framinan, Rainer Leisten 
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
Recommendations
- Minimizing total tardiness in permutation flowshops
- Total tardiness minimization in permutation flowshop with deterioration consideration
- Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints
- The permutation flowshop scheduling problem with exact time lags to minimise the total earliness and tardiness
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Permutation flow shops with exact time lags to minimise maximum lateness
- New heuristics for total tardiness minimization in a flexible flowshop
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times
Cites Work
- Tabu search for total tardiness minimization in flowshop scheduling problems
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Scheduling in flowshops to minimize total tardiness of jobs
- Benchmarks for shop scheduling problems
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- Flowshop-scheduling problems with makespan criterion: a review
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- Approximative procedures for no-wait job shop scheduling.
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
Cited In (23)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion
- Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
- Solving customer order scheduling problems with an iterated greedy algorithm
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- Minimizing total tardiness in permutation flowshops
- A variable iterated greedy algorithm for the traveling salesman problem with time windows
- Minimizing total tardiness in no-wait flowshops
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
This page was built for publication: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605449)
