Algorithms for a realistic variant of flowshop scheduling
From MaRDI portal
Publication:732880
DOI10.1016/j.cor.2009.04.017zbMath1175.90186OpenAlexW1982360953MaRDI QIDQ732880
Rubén Ruiz, Mostafa Zandieh, Bahman Naderi
Publication date: 15 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.04.017
schedulingsequence dependent setup timesdynamic dispatching rule heuristichybrid flexible flowshopsiterated local search metaheuristic
Search theory (90B40) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Hybrid flexible flowshop problems: models and solution methods ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows ⋮ Iterated greedy algorithms enhanced by hyper-heuristic based learning for hybrid flexible flowshop scheduling problem with sequence dependent setup times: a case study at a manufacturing plant ⋮ A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows ⋮ Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II ⋮ An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem ⋮ Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times ⋮ Approximation algorithms for the parallel flow shop problem ⋮ Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems ⋮ Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times ⋮ An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation ⋮ A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation ⋮ Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A taxonomy of flexible flow line scheduling procedures
- Modeling realistic hybrid flexible flowshop scheduling problems
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- The flow shop scheduling polyhedron with setup times
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Scheduling flexible flow lines with sequence-dependent setup times
- The significance of reducing setup times/setup costs
- A survey of scheduling problems with setup times or costs
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Optimal two- and three-stage production schedules with setup times included
- Two-Stage, Hybrid Flowshop Scheduling Problem
- The Lessons of Flowshop Scheduling Research
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A genetic algorithm methodology for complex scheduling problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- A branch-and-bound-based local search method for the flow shop problem
