An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times

DOI10.1016/j.amc.2005.11.136zbMath1102.90029OpenAlexW1981760439MaRDI QIDQ850231

S. M. Moattar Husseini, Seyyed Mohammad Taghi Fatemi Ghomi, Mostafa Zandieh

Publication date: 15 November 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.11.136

zbMATH Keywords

heuristicsmakespansequence dependent setup timesimmune algorithmsshort-term schedulinghybrid flow shops

Mathematics Subject Classification ID

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

Related Items

Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis, Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times, Hybrid flexible flowshop problems: models and solution methods, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Efficient heuristic algorithm for scheduling two-stage hybrid flowshop with sequence-dependent setup times, 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, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time, Forecasting concentrations of air pollutants by logarithm support vector regression with immune algorithms, Reducing network and computation complexities in neural based real-time scheduling scheme, A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, A survey of scheduling problems with setup times or costs, Hybrid flowshop scheduling with machine and resource-dependent processing times, The hybrid flow shop scheduling problem, An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns, Scheduling job shop problems with sequence-dependent setup times, A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility, A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem, Algorithms for a realistic variant of flowshop scheduling

Uses Software

• Genocop
• BPSS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Branch and bound algorithm for the flow shop with multiple processors
• Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
• A fast tabu search algorithm for the permutation flow-shop problem
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• An approximation algorithm for a single-machine scheduling problem with release times and delivery times
• Scheduling a two-stage hybrid flowshop with separable setup and removal times
• Minimizing makespan in hybrid flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Two-stage flowshop scheduling with a common second-stage machine
• Job shop scheduling with group-dependent setups, finite buffers, and long time horizon
• Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
• A simple non-linear model of immune response
• The flow shop with parallel machines: A tabu search approach
• Heuristics for scheduling in a flow shop with multiple processors
• Scheduling flexible flow lines with sequence-dependent setup times
• Optimal two- and three-stage production schedules with setup times included
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• Two-Stage, Hybrid Flowshop Scheduling Problem
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A computational study of heuristics for two-stage flexible flowshops
• A genetic algorithm methodology for complex scheduling problems
• A flowshop scheduling problem with two operations per job
• Scheduling flexible flow lines with no in-process buffers
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
• Sequencing n jobs on two machines with setup, processing and removal times separated
• Analysis of Classes of Heuristics for Scheduling a Two-Stage Flow Shop with Parallel Machines at One Stage