Similar Search Results

Note---A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem

Bagga, P. C.; Kalra, K. R. - In: Management Science 26 (1980) 6, pp. 633-636

In this note, a node elimination procedure has been suggested in case the two sequences obtained by using Townsend's (Townsend, W. 1978. The single machine problem with quadratic penalty function of completion times: A branch and bound solution. Management Sci. 24 (5) 530--534.) sufficient...

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

A Dual-Based Procedure for Dynamic Facility Location

Roy, Tony J. Van; Erlenkotter, Donald - In: Management Science 28 (1982) 10, pp. 1091-1105

In dynamic facility location problems, one desires to select the time-staged establishment of facilities at different locations so as to minimize the total discounted costs for meeting demands specified over time at various customer locations. We formulate a particular dynamic facility location...

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

Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms"

Cornuejols, Gerard; Fisher, Marshall L.; Nemhauser, … - In: Management Science 25 (1979) 8, pp. 808-809

In the course of the deliberations of the 1977 Lanchester Prize Committee, Alan J. Goldman brought to our attention an error in the proof of Lemma 1 of our paper (Cornuejols, G., M. L. Fisher, G. L. Nemhauser. 1977. Location of bank accounts to optimize float: an analytic study of exact and...

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

Inverse Optimization: An Application to the Capacitated Plant Location Problem

Bitran, Gabriel R.; Chandru, Vijaya; Sempolinski, Dorothy E. - In: Management Science 27 (1981) 10, pp. 1120-1141

Lagrangean techniques have had wide application to the optimization of discrete optimization problems. Inverse optimization refers to the fact that each time a Lagrangean calculation is made for a specific problem with a given resources vector, an optimal solution is obtained for a related...

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

A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints

Weiss, Howard J. - In: Management Science 27 (1981) 10, pp. 1209-1216

We present a greedy heuristic for the n job/1 machine scheduling problem with precedence constraints. This method is … greedy heuristic found the optimal solution for 58 of 68 test problems for which a branch and bound method was used to find … the optimal solution. The heuristic is, of course, much easier to implement (and executes in less time). The greedy …

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

Branch and Bound Experiments in Convex Nonlinear Integer Programming

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

objective minimum is attained, heuristic rules are developed to locate an integer feasible solution to provide an upper bound …

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

Weighted Assignment Models and Their Application

Ross, G. Terry; Zoltners, Andris A. - In: Management Science 25 (1979) 7, pp. 683-696

This paper defines the components and characteristics of an important class of models called weighted assignment models and identifies these elements in a number of existing and potential applications. The weighted assignment model represents problems with the following characteristics: A set of...

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

A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising

Dwyer, F. Robert; Evans, James R. - In: Management Science 27 (1981) 6, pp. 658-667

efficient direct mail catalogue distribution, the algorithm exploits current heuristic approaches which improve computational …

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

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

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

considered. Due to the richness of the literature, we exclude from discussion here (a) the inexact (i.e., heuristic …

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

Resource-Constrained Project Scheduling with Time-Resource Tradeoffs: The Nonpreemptive Case

Talbot, F. Brian - In: Management Science 28 (1982) 10, pp. 1197-1210

-effective optimal solutions for small problems and good heuristic solutions for larger problems. The programmed solution algorithms are …

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