A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness

Cites Work

NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
Variable neighborhood search
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
A survey of scheduling problems with no-wait in process
Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
Minimizing the weighted sum of squared tardiness on a single machine
Two models for a family of flowshop sequencing problems
No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan
A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
Minimizing total tardiness in no-wait flowshops
Efficient local search algorithms for the linear ordering problem
New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness
Computing in Operations Research Using Julia
Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
Comparative evaluation of MILP flowshop models
Incorporating preventive maintenance into the m-machine no-wait flow-shop scheduling problem with total flow-time minimization: a computational study
Variable neighborhood search: Principles and applications
An iterated greedy algorithm for the no-wait flowshop scheduling problem to minimize makespan subject to total completion time

This page was built for publication: A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness