Pages that link to "Item:Q337554"
From MaRDI portal
The following pages link to NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554):
Displayed 25 items.
- 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)
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation (Q1752855) (← links)
- Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation (Q2003426) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← links)
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
- Just-in-time scheduling for a distributed concrete precast flow shop system (Q2668621) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem (Q2669708) (← links)
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective (Q2669789) (← links)
- A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances (Q2669799) (← links)
- Simulation Optimization for MRO Systems Operations (Q4978462) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine (Q6084515) (← links)
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)
- The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)