A new approximate algorithm for multidimensional zero-one knapsack problems with all positive coefficients is presented. The procedure is controlled by three parameters which affect the tradeoff between solution quality and computation time and whose values are set by the users. For 48 test...

This note develops optimal multiple rest break models for the case when the decay in work rate is an exponential function of time worked and recovery of work rate potential during rest is a linear function of time rested. While empirical evidence indicates that work rate decay functions tend to...

An optimization-based decision support system has been developed and used by NABISCO to manage complex problems involving facility selection, equipment location and utilization, and manufacture and distribution of products such as the familiar Ritz Crackers, Oreo Cookies, Fig Newtons, etc. (all...

This paper addresses a nonpreemptive single machine scheduling problem where all jobs have a common due date and have zero ready time. The scheduling objective is to minimize mean squared deviation (MSD) of job completion times about the due date. This nonregular measure of performance is...

In this survey paper we discuss the development of the simple assembly line balancing problem (SALBP); modifications and generalizations over time; present alternate 0-1 programming formulations and a general integer programming formulation of the problem; discuss other well-known problems...

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...

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...

Backup coverage, the second coverage of a demand node, is suggested as a decision criterion in modelling the location of emergency services on a network. The efficient handling of stochastic demand by vehicles which can respond to only one call at a time may require backup coverage in areas of...

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...

Production and capacity expansion decisions are difficult to analyze when there is learning. Later production is less costly, and maybe more profitable, but the company must endure high initial production costs. Mixed integer programming models are presented for optimizing coordinated production...