The paper describes a procedure for mixed integer programming that allows branches to be imposed 'by degrees', which can subsequently be revised or weeded out according to their relative influence. It is an adaptive approach in which the branch and bound tree can be maillipulated and rl'Structured. The approach also yields measures of the costs of imposing the branches that lead to integer solu...

Branch and bound algorithms are methods for global optimization in nonconvex problems [LW66, Moo91]. They are nonheuristic, in the sense that they maintain a provable upper and lower bound on the (globally) optimal objective value; they terminate with a certificate proving that the suboptimal point found is ǫ-suboptimal. Branch and bound algorithms can be (and often are) slow, however. In the w...

This paper studies minimizing the #ow time of a cyclic schedule for repeated identical jobs, where one job is started/completed in each cycle, subject to the schedule achieving maximum throughput. We propose a branch and bound method for a single machine problem, and use this method to derive an improved lower bound for the multiple machine problem. c © 2003 Elsevier B.V. All rights reserved.

This paper proposes a heuristic algorithm, called list-based squeezing branch and bound algorithm, for solving a machine-fixed, machining-assembly flowshop scheduling problem to minimize makespan. The machine-fixed, machining-assembly flowshop consists of some parallel two-machine flow lines at a machining stage and one robot at an assembly stage. Since an optimal schedule for this problem is n...

 This paper addresses the problem of scheduling autonomous vehicles to traverse several adjacent intersections with the consideration of Vehicle to Infrastructure (V2I) communication technology. Due to the combinatorial nature of the control strategy, we decentralize the problem into several isolated intersection control problems and model each of them as a special single machine scheduling pr...

This paper addresses a bi-criteria two-machine flowshop scheduling problem when the learning effect is present. The objective is to find a sequence that minimizes a weighted sum of the total completion time and the maximum tardiness. In this article, a branch-and-bound method, incorporating several dominance properties and a lower bound, is presented to search for the exact solution for small j...