Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
From MaRDI portal
Publication:1652188
DOI10.1016/j.cor.2016.11.022zbMath1391.90301OpenAlexW2550749820MaRDI QIDQ1652188
Rubén Ruiz, Pedro Alfaro-Fernández, Quan-ke Pan
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/151047
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows, A systematic review of multi-objective hybrid flow shop scheduling, Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems, Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility, Automatic algorithm design for hybrid flowshop scheduling problems, A mathematical model and two-stage heuristic for hot rolling scheduling in compact strip production, Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
Uses Software
Cites Work
- Clarifying cutting and sewing processes with due windows using an effective ant colony optimization
- Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
- Bounding strategies for the hybrid flow shop scheduling problem
- Algorithms for a realistic variant of flowshop scheduling
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A taxonomy of flexible flow line scheduling procedures
- An improved earliness--tardiness timing algorithm
- A discrete particle swarm optimization for lot-streaming flowshop scheduling problem
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date
- Iterated greedy local search methods for unrelated parallel machine scheduling
- Shifting representation search for hybrid flexible flowline problems
- The distributed permutation flowshop scheduling problem
- Optimal common due-date with limited completion time deviation
- A comprehensive review and evaluation of permutation flowshop heuristics
- A decomposition algorithm for the single machine total tardiness problem
- The hybrid flow shop scheduling problem
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Experimental Methods for the Analysis of Optimization Algorithms
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Manufacturing Scheduling Systems
- Multiple machine JIT scheduling: a tabu search approach
- Local Search in Complex Scheduling Problems
- Scheduling
