We present a generic branch-and-bound algorithm for finding all the Pareto solutions of biobjective mixed-integer linear program. The main contributions are new algorithms obtaining dual bounds at node, checking node fathoming, presolve, and duality gap measurement. Our is predominantly decision space search method because branching performed on variables, akin to single objective problems, alt...

To design a group layout of a cellular manufacturing system (CMS) in a dynamic environment, a multi-objective mixed-integer non-linear programming model is developed. The model integrates cell formation, group layout and production planning (PP) as three interrelated decisions involved in the design of a CMS. This paper provides an extensive coverage of important manufacturing features u...

One of the most complicated decision making problems for managers is the evaluation of bank performance, which involves various criteria. There are many studies about bank efficiency evaluation by network DEA in the literature review. These studies do not focus on multi-level network. Wu (Eur J Oper Res 207:856–864, 2010) proposed a bi-level structure for cost efficiency at the first time. In t...

We consider the planning and scheduling of production in a multi-task/multi-stage batch manufacturing process typical of industries such as chemical manufacturing, food processing, and oil refining. We allow instances in which multiple sequences of tasks may be used to produce end products. We formulate the problem as a mixed integer linear program and show that the linear programming relaxatio...

Design of a logistics network in proper way provides a proper platform for efficient and effective supply chain management. This paper studies a multi-period, multi echelon and multi-product integrated forward-reverse logistics network under uncertainty. First, an efficient complex mixed-integer linear programming (MILP) model by considering some real-world assumptions is developed for the inte...