NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
From MaRDI portal
(Redirected from Publication:337554)
Recommendations
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Minimizing total tardiness in permutation flowshops
Cites work
- scientific article; zbMATH DE number 3425355 (Why is no real title available?)
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- A comprehensive review and evaluation of permutation flowshop heuristics
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A decomposition algorithm for the single machine total tardiness problem
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- An empirical analysis of the optimality rate of flow shop heuristics
- An improved NEH heuristic to minimize makespan in permutation flow shops
- An improved NEH-based heuristic for the permutation flowshop problem
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- Heuristics for scheduling in a flow shop with multiple processors
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem
- On recent modifications and extensions of the NEH heuristic for flow shop sequencing
- Scheduling in flowshops to minimize total tardiness of jobs
- Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times.
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- Some efficient heuristic methods for the flow shop sequencing problem
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Cited in
(28)- Simulation optimization for mro systems operations
- Bicriterion optimization for flow shop with a learning effect subject to release dates
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Flowshop scheduling problem with parallel semi-lines and final synchronization operation
- A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness
- Order scheduling with tardiness objective: improved approximate solutions
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- A simheuristic algorithm for the portfolio optimization problem with random returns and noisy covariances
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
- A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness
- Just-in-time scheduling for a distributed concrete precast flow shop system
- Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
- A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling
This page was built for publication: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337554)
