A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem

DOI10.1007/BF02125405zbMath0851.90066MaRDI QIDQ1919850

Jorge Haddock, Sunderesh S. Heragu, Amit Nagar

Publication date: 18 September 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound; genetic algorithm; meta-heuristic; near-optimal solutions; two-machine flowshop scheduling

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

90B35: Deterministic scheduling theory in operations research

Related Items

Flowshop-scheduling problems with makespan criterion: a review, Combining metaheuristics with mathematical programming, constraint programming and machine learning, Combining metaheuristics with mathematical programming, constraint programming and machine learning, On operators and search space topology in multi-objective flow shop scheduling, A proposal for a hybrid meta-strategy for combinatorial optimization problems, Hybridizing exact methods and metaheuristics: a taxonomy, Multiple and bicriteria scheduling: A literature survey, No-wait flowshops with bicriteria of makespan and maximum lateness., The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime, Metaheuristics: A bibliography, Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems, Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization, A genetic algorithm for solving the economic lot scheduling problem in flow shops

Cites Work

• Unnamed Item
• Unnamed Item
• Multiple and bicriteria scheduling: A literature survey
• A Mixed-Integer Goal-Programming Formulation of the Standard Flow-Shop Scheduling Problem
• Two-Stage Flowshop Scheduling Problem with Bicriteria
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem