A genetic algorithm for flowshop scheduling with multiple objectives

DOI10.1007/BF03398787zbMath1161.90398OpenAlexW2775515374MaRDI QIDQ1018947

S. Deva Prasad

Publication date: 26 May 2009

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398787

zbMATH Keywords

schedulinggenetic algorithmflowshopmultiple objectivesnon-dominated solutions

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Applying available-to-promise (ATP) concept in mixed-model assembly line sequencing problems in a make-to-order (MTO) environment: problem extension, model formulation and Lagrangian relaxation algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• The Complexity of Flowshop and Jobshop Scheduling
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem

This page was built for publication: A genetic algorithm for flowshop scheduling with multiple objectives