摘要:

This paper deals with budgeting procedures in a multi-division firm. The global objective function of the firm is composed of maximizing the present value and minimizing the risk of the accepted projects. A weight is assigned to each one of these objectives. Different budgeting procedures are developed for the cases where these weights are known or unknown and for centralized and decentralized settings. In the cases where these weights are known, mathematical programming methods are suggested. However, in the cases where the values of the weights are unspecified, the notion of Discrete Efficient Frontier (DEF) is developed to represent sets of efficient (not dominated) combinations of projects. A simple measure of performance is developed for evaluating the effectiveness of the various budgeting procedures. This measure is based on the total area beneath the DEF. Finally, an extensive simulation study is carried out to see the effectiveness of the centralized vs. the decentralized procedures suggested in this study.

ISSN:0740-817X    

DOI:10.1080/07408178708975363

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

For a multi-stage production system, optimal location of inspection activities is an important consideration in minimizing the inspection-related and salvage costs. Set-up and inventory carrying costs also become important factors when several products are produced on the same line due to the product changeovers involved.

ISSN:0740-817X    

DOI:10.1080/07408178708975364

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

We present a real-world problem that illustrates how different linear programming formulations allow different interpretations of solution results and sensitivity analyses. The problem involves the allocation of looms to weave various fabrics in a textile mill and the determination of which fabrics should be purchased outside of the mill in order to meet demand. The case has been used as a teaching tool for emphasizing often over-looked model formulation issues.

ISSN:0740-817X    

DOI:10.1080/07408178708975365

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

A scheduling problem often arising in trade shows and conventions is modeled as a planar three-dimensional assignment problem having a special cost structure. A polynomial-time algorithm for solving this case of the planar assignment problem is presented. The algorithm can also be used to solve heuristically a variation of the m-traveling salesman problem which arises as a secondary problem in the original scheduling application. Computational experience with data from a tourism industry convention scheduling problem is given.

ISSN:0740-817X    

DOI:10.1080/07408178708975366

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

Existing studies on heuristic lot-sizing techniques for multistage production systems concentrate on optimizing the production operations of the individual stages. This approach induces a family of heuristics, in which the production plans for the individual stages are computed sequentially starting from the final stage. In this paper we introduce a parallel heuristic for the problem. The method, which may be considered as the generalization of the single stage Wagner-Whitin algorithm, attempts to optimize over all stages simultaneously, while building the production plans in a forward manner. In computational experiments the new algorithm performed extremely well.

ISSN:0740-817X    

DOI:10.1080/07408178708975367

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

The problem of scheduling products, with constant demand rates, on a single facility is difficult. This difficulty is compounded if the setup costs are not constant for each product but depend on the sequence in which the products are made. A heuristic that iterates between solving the scheduling problem with constant setup costs and solving a “traveling salesman” formulation with sequence dependent setup costs is presented. The heuristic works well in practice and always provides a feasible solution if one exists. Some computational experience is also given.

ISSN:0740-817X    

DOI:10.1080/07408178708975368

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

Recent investigations into the work-time distributions of light assembly tasks indicate that some reserve must be used when applying the generalized relationships which are traditionally believed to hold.

ISSN:0740-817X    

DOI:10.1080/07408178708975369

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

This paper addresses throughput improvement by retrieval sequencing in conventional unit load automated storage/retrieval systems when several retrieval requests are available and dual command cycles are performed. Taking first-come-first-served as the reference sequencing rule, the potential for improvement is identified. A “nearest-neighbor” sequencing rule is proposed as an alternative, an analytic model for its expected performance is developed, and Monte Carlo simulation is used for evaluation. In addition, a lower bound on dual command cycle times is developed, and the dynamic behavior of two heuristic sequencing rules is discussed.

ISSN:0740-817X    

DOI:10.1080/07408178708975370

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

This paper examines a mathematical programming method of accounting for capacity costs for the deterministic, multi-item, single operation lot sizing problem. With the capacity constraints of CLSP removed with Lagrangian relaxation, the problem decomposes into a set of uncapacitated single product lot sizing problems which are solved with dynamic programming. The Lagrangian dual costs are updated by subgradient optimization. Feasible solutions (production plans within the capacity limitations) are constructed with a heuristic smoothing procedure. The dual-cost heuristic gave solutions which were better on average than the other algorithms tested (and was faster than some comparable algorithms).

ISSN:0740-817X    

DOI:10.1080/07408178708975371

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor

摘要:

In this paper we present a branch and bound algorithm for solving a single-item, multi-source dynamic lot sizing problem with time-varying capacity constraints. We consider a single-item production (and/or procurement) environment where there are multiple sources of supply with different cost structures. Computational results are presented.

ISSN:0740-817X    

DOI:10.1080/07408178708975372

出版商:Taylor & Francis Group    

年代:1987

数据来源: Taylor