Algorithms for a realistic variant of flowshop scheduling

DOI10.1016/J.COR.2009.04.017zbMATH Open1175.90186OpenAlexW1982360953MaRDI QIDQ732880FDOQ732880

Mostafa Zandieh, Rubén Ruiz, 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

Recommendations

• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Modeling realistic hybrid flexible flowshop scheduling problems
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
• Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times
• Metaheuristic algorithms for the hybrid flowshop scheduling problem

zbMATH Keywords

schedulingsequence dependent setup timesdynamic dispatching rule heuristichybrid flexible flowshopsiterated local search metaheuristic

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Optimal two- and three-stage production schedules with set-up time included
• A survey of scheduling problems with setup times or costs
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• Title not available (Why is that?)
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Stochastic local search. Foundations and applications.
• Modeling realistic hybrid flexible flowshop scheduling problems
• A comprehensive review and evaluation of permutation flowshop heuristics
• The significance of reducing setup times/setup costs
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• The Lessons of Flowshop Scheduling Research
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A taxonomy of flexible flow line scheduling procedures
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Design and analysis of experiments.
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A genetic algorithm methodology for complex scheduling problems
• A branch-and-bound-based local search method for the flow shop problem
• Scheduling flexible flow lines with sequence-dependent setup times
• An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
• The flow shop scheduling polyhedron with setup times

Cited In (20)

• Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems
• A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation
• 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
• Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II
• Hybrid flexible flowshop problems: models and solution methods
• Title not available (Why is that?)
• Approximation algorithms for the parallel flow shop problem
• Modeling realistic hybrid flexible flowshop scheduling problems
• Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
• 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
• Algorithms for Flows over Time with Scheduling Costs
• Sevast'yanov's algorithm for the flow-shop scheduling problem
• Maximizing Throughput in Flow Shop Real-Time Scheduling
• A parameter-less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows
• An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
• Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times
• An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
• Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective

This page was built for publication: Algorithms for a realistic variant of flowshop scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732880)