Improved genetic algorithm for the permutation flowshop scheduling problem.

DOI10.1016/S0305-0548(03)00016-9zbMath1046.90028OpenAlexW2078211329MaRDI QIDQ1427101

Barkha Saxena, Srikanth K. Iyer

Publication date: 14 March 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00016-9

zbMATH Keywords

Genetic algorithmsDesign of experimentsLongest common subsequencePermutation flowshop scheduling

Mathematics Subject Classification ID

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

Related Items (23)

A SINGLE-MACHINE TWO-AGENT SCHEDULING PROBLEM BY GA APPROACH ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Parallel partitioning method (PPM): A new exact method to solve bi-objective problems ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times ⋮ A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks ⋮ Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times ⋮ A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network ⋮ A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems ⋮ Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ On solving the double loading problem using a modified particle swarm optimization ⋮ Modeling and analysis of multiobjective lot splitting for N -product M -machine flowshop lines ⋮ A bicriteria flowshop scheduling with a learning effect ⋮ Fuzzy scheduling of job orders in a two-stage flowshop with batch-processing machines ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ An effective hybrid genetic algorithm for flow shop scheduling with limited buffers ⋮ A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ An empirical analysis of the optimality rate of flow shop heuristics

Cites Work

• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A genetic algorithm for flowshop sequencing
• Optimal two- and three-stage production schedules with setup times included
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved genetic algorithm for the permutation flowshop scheduling problem.