Pages that link to "Item:Q3605449"
From MaRDI portal
The following pages link to Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449):
Displayed 21 items.
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073) (← links)
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- A variable iterated greedy algorithm for the traveling salesman problem with time windows (Q506326) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Metaheuristics for the single machine weighted quadratic tardiness scheduling problem (Q1651631) (← links)
- Two-sided assembly line balancing problem of type I: improvements, a simple algorithm and a comprehensive study (Q1652149) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion (Q1652608) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- Minimizing the cycle time in two-sided assembly lines with assignment restrictions: improvements and a simple algorithm (Q1793174) (← links)
- Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
- Minimizing total tardiness in no-wait flowshops (Q2978428) (← links)
- A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs (Q6070118) (← links)
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)