A Branch & Bound Algorithm for the Open-Shop Problem

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(96)00116-3
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem

Optimization Letters
ControlOptimization
2014English

Genetic Algorithm Tuning Applied to the Open Shop Scheduling Problem

International Journal of Applied Information Systems
2016English

A Branch-And-Bound Method for the Multichromosomal Reversal Median Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Approximation Algorithms for the Multiprocessor Open Shop Scheduling Problem

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
1999English

A Genetic Algorithm for a Bicriteria Flow-Shop Scheduling Problem

Transactions of the Institute of Systems, Control and Information Engineers
1997English

Technical Note—On Partitioning the Feasible Set in a Branch-And-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1973English

The Stage Shop Scheduling Problem: Lower Bound and Metaheuristic

Scientia Iranica
2018English

A Lagrangian-Based Branch-And-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem With Single-Assignment Constraints

Transportation Science
CivilTransportationStructural Engineering
2016English

A Branch-And-Bound Algorithm for Quadratically-Constrained Sparse Filter Design

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy