Results 1  10
of
826,953
A BranchandBound Algorithm to Solve a TwoMachine Bicriteria Flowshop Scheduling Problem
, 2001
"... This paper develops a branchandbound algorithm and a heuristic algorithm for solving the twomachine flow shop scheduling problem with the objective of minimizing total flow time, subject to the constraint that the makespan is minimum. Results of extensive computational tests show that the propose ..."
Abstract
 Add to MetaCart
This paper develops a branchandbound algorithm and a heuristic algorithm for solving the twomachine flow shop scheduling problem with the objective of minimizing total flow time, subject to the constraint that the makespan is minimum. Results of extensive computational tests show
A GPUaccelerated branchandbound algorithm for the flowshop scheduling problem
 in 2012 IEEE International Conference on Cluster Computing (CLUSTER
, 2012
"... Abstract—BranchandBound (B&B) algorithms are timeintensive treebased exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those methods. The focus is put on the boun ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Abstract—BranchandBound (B&B) algorithms are timeintensive treebased exploration methods for solving to optimality combinatorial optimization problems. In this paper, we investigate the use of GPU computing as a major complementary way to speed up those methods. The focus is put
Grid BranchandBound for Permutation Flowshop
"... Abstract. Flowshop is an example of a classic hard combinatorial problem. Branchandbound is a technique commonly used for solving such hard problems. Together, the two can be used as a benchmark of maturity of parallel processing environment. Grid systems pose a number of hurdles which must be ove ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. Flowshop is an example of a classic hard combinatorial problem. Branchandbound is a technique commonly used for solving such hard problems. Together, the two can be used as a benchmark of maturity of parallel processing environment. Grid systems pose a number of hurdles which must
BranchandBound. A Case Study: the FlowShop Scheduling Problem
"... graphics processors was dedicated to graphics applications. Driven by the demand for highdefinition 3D graphics on personal computers, GPUs have evolved into a highly parallel, multithreaded and manycore environment. Their utilization has recently been extended to other application domains such as ..."
Abstract
 Add to MetaCart
of using a parallel bounding model for designing B&B algorithms over GPUs. The proposed model assumes parallelizing the evaluation of the lower bounds on pools of subproblems. The experimental results show that significant accelerations can be obtained especially for large
Twomachine flowshop scheduling with bicriteria problem
"... This paper attempts to solve a twomachine flowshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total flow time and makespan. To tackle this scheduling problem, an integer programming model with N 2+3N variables and 5 ..."
Abstract
 Add to MetaCart
This paper attempts to solve a twomachine flowshop bicriteria scheduling problem with release dates for the jobs, in which the objective function is to minimize a weighed sum of total flow time and makespan. To tackle this scheduling problem, an integer programming model with N 2+3N variables
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 565 (0 self)
 Add to MetaCart
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps
A BranchandBound Based Heuristic Algorithm for Minimizing Makespan in
, 2014
"... This paper proposes a heuristic algorithm, called listbased squeezing branch and bound algorithm, for solving a machinefixed, machiningassembly flowshop scheduling problem to minimize makespan. The machinefixed, machiningassembly flowshop consists of some parallel twomachine flow lines at a ..."
Abstract
 Add to MetaCart
This paper proposes a heuristic algorithm, called listbased squeezing branch and bound algorithm, for solving a machinefixed, machiningassembly flowshop scheduling problem to minimize makespan. The machinefixed, machiningassembly flowshop consists of some parallel twomachine flow lines at a
A Limited Memory Algorithm for Bound Constrained Optimization
 SIAM Journal on Scientific Computing
, 1994
"... An algorithm for solving large nonlinear optimization problems with simple bounds is described. ..."
Abstract

Cited by 557 (9 self)
 Add to MetaCart
An algorithm for solving large nonlinear optimization problems with simple bounds is described.
Results 1  10
of
826,953