A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
From MaRDI portal
Publication:1919850
DOI10.1007/BF02125405zbMath0851.90066OpenAlexW2055418225MaRDI QIDQ1919850
Amit Nagar, Sunderesh S. Heragu, Jorge Haddock
Publication date: 18 September 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02125405
branch-and-boundgenetic algorithmmeta-heuristicnear-optimal solutionstwo-machine flowshop scheduling
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Related Items
An effective matheuristic for the capacitated total quantity discount problem ⋮ On operators and search space topology in multi-objective flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization ⋮ A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems ⋮ No-wait flowshops with bicriteria of makespan and maximum lateness. ⋮ A genetic algorithm for solving the economic lot scheduling problem in flow shops ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Hybridizing exact methods and metaheuristics: a taxonomy ⋮ Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems ⋮ The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime
Cites Work
