Publication | Closed Access
An Exact Method for Solving the Multi-Processor Flow-Shop
124
Citations
0
References
2000
Year
Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringMulti-processor Flow-shopIndustrial EngineeringComputer ArchitectureDiscrete OptimizationParallel MetaheuristicsProcessor ArchitectureOperations ResearchRelease DatesSystems EngineeringParallel ComputingCombinatorial OptimizationBound MethodInstruction-level ParallelismComputer EngineeringComputer ScienceInteger ProgrammingNew BranchProgram AnalysisProduction SchedulingMultiprocessor SystemParallel ProgrammingSystem Software
The aim of this paper is to present a new branch and bound method for solving the Multi-Processor Flow-Shop. This method is based on the relaxation of the initial problem to m-machine problems corresponding to centers. Release dates and tails are associated with operations and machines. The branching scheme consists in fixing the inputs of a critical center and the lower bounds are those of the m-machine problem. Several techniques for adjusting release dates and tails have also been introduced. As shown by our personal study, the overall method is very efficient.