Algorithms for a realistic variant of flowshop scheduling
From MaRDI portal
(Redirected from Publication:732880)
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
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A branch-and-bound-based local search method for the flow shop problem
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A comprehensive review and evaluation of permutation flowshop heuristics
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- A genetic algorithm methodology for complex scheduling problems
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
- A survey of scheduling problems with setup times or costs
- A taxonomy of flexible flow line scheduling procedures
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Design and analysis of experiments.
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
- Modeling realistic hybrid flexible flowshop scheduling problems
- Optimal two- and three-stage production schedules with set-up time included
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling flexible flow lines with sequence-dependent setup times
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- Stochastic local search. Foundations and applications.
- The Lessons of Flowshop Scheduling Research
- The flow shop scheduling polyhedron with setup times
- The significance of reducing setup times/setup costs
- Two-Stage, Hybrid Flowshop Scheduling Problem
Cited in
(27)- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- 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
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- 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
- Hybrid flexible flowshop problems: models and solution methods
- Approximation algorithms for the parallel flow shop problem
- Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II
- Modeling realistic hybrid flexible flowshop scheduling problems
- scientific article; zbMATH DE number 4093162 (Why is no real title available?)
- 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
- Shifting representation search for hybrid flexible flowline problems
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Algorithms for Flows over Time with Scheduling Costs
- Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration
- 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
- Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times
- 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)
