A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
From MaRDI portal
Publication:1919850
DOI10.1007/BF02125405zbMath0851.90066MaRDI 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-bound; genetic algorithm; meta-heuristic; near-optimal solutions; two-machine flowshop scheduling
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, A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems, An effective matheuristic for the capacitated total quantity discount problem, 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
