Search Results - subject:"Algorithms."

Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras

Méndez, Eduardo - In: TOP: An Official Journal of the Spanish Society of … 1 (1986) 1, pp. 23-49

Persistent link: https://www.econbiz.de/10005598338

A Survey of Exact Algorithms for the Simple Assembly Line Balancing Problem

\.Ilker Baybars - In: Management Science 32 (1986) 8, pp. 909-932

deterministic (i.e., all input parameters are assumed to be known with certainty) and all the algorithms discussed are exact. The …/approximate) algorithms for SALPB and (b) the algorithms for the general assembly line balancing problem (including the stochastic models). …

Persistent link: https://www.econbiz.de/10009191539

Heuristics for Multilevel Lot-Sizing with a Bottleneck

Billington, Peter J.; McClain, John O.; Thomas, L. Joseph - In: Management Science 32 (1986) 8, pp. 989-1006

In this paper we present a heuristic method, based on Lagrangian relaxation, for multilevel lot-sizing when there is a single bottleneck facility. A series of Lagrangian relaxations (one for each item in the product structure) is imbedded in a branch and bound procedure. The objective is to find...

Persistent link: https://www.econbiz.de/10009203846

A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems

Berrada, Mohammed; Stecke, Kathryn E. - In: Management Science 32 (1986) 10, pp. 1316-1335

A flexible manufacturing system (FMS) is an integrated system of computer numerically controlled machine tools connected with automated material handling. A set of production planning problems for FMSs has been defined (Stecke [Stecke, Kathryn E. 1983. Formulation and solution of nonlinear...

Persistent link: https://www.econbiz.de/10009204405

Improved Penalties for Fixed Cost Linear Programs Using Lagrangean Relaxation

Cabot, A. Victor; Erenguc, S. Selcuk - In: Management Science 32 (1986) 7, pp. 856-869

The most commonly used penalty in branch and bound approaches to integer programming is the Driebeek--Tomlin penalty. It has been used successfully in solving fixed cost linear programs by Kennington and Unger and by Barr, Glover and Klingman. It is well known that the Driebeek--Tomlin penalty...

Persistent link: https://www.econbiz.de/10009218041

Branch and Bound Experiments in Convex Nonlinear Integer Programming

Gupta, Omprakash K.; Ravindran, A. - In: Management Science 31 (1985) 12, pp. 1533-1546

The branch and bound principle has long been established as an effective computational tool for solving mixed integer linear programming problems. This paper investigates the computational feasibility of branch and bound methods in solving convex nonlinear integer programming problems. The...

Persistent link: https://www.econbiz.de/10009191202

New Polynomial Shortest Path Algorithms and Their Computational Attributes

Glover, Fred; Klingman, Darwin D.; Phillips, Nancy V.; … - In: Management Science 31 (1985) 9, pp. 1106-1128

three different network topologies indicate that these new algorithms have excellent computational performance … characteristics. Based on total solution times for the 4500 test problems, these new algorithms out-perform all other algorithms … tested. In addition, one of the near-sharp algorithms strictly dominates all others on all problem topologies tested. …

Persistent link: https://www.econbiz.de/10009197416

A Cluster-Analytic Approach to Facility Layout

Scriabin, Michael; Vergin, Roger C. - In: Management Science 31 (1985) 1, pp. 33-49

Due to the combinatorial nature of the facility layout problem, current heuristic computer procedures do not always provide better solutions than visual methods. A new algorithm, FLAC (Facility Layout by Analysis of Clusters), is described which emulates the visual methods used by industrial...

Persistent link: https://www.econbiz.de/10009204285

Scheduling to Minimize Maximum Workload

Lüthi, Hans-Jakob; Polyméris, Andrés - In: Management Science 31 (1985) 11, pp. 1409-1415

minimizes the maximum total workload. These algorithms require a computational time of the order of m<sup>2</sup> and negligible …

Persistent link: https://www.econbiz.de/10009208709

Successive Linear Programming at Exxon

Baker, Thomas E.; Lasdon, Leon S. - In: Management Science 31 (1985) 3, pp. 264-274

Successive Linear Programming (SLP) has been used extensively in the refining and petrochemical industries for over 20 years. This paper concentrates on some recent work at Exxon to unify the treatment of nonlinear terms in "mostly linear" models. We first discuss the source of nonlinearities in...

Persistent link: https://www.econbiz.de/10009208846