ISSN:0740-817X    

DOI:10.1080/07408178408975247

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

The personnel scheduling problem is addressed through a multiple-criteria decision system. A four-stage process is proposed which utilizes analytic models and computer simulation to develop an aggregate shift schedule. The scheduler plays a key role in generating the personnel schedule. A queueing model converts customer (task) arrival rates into personnel requirements for each scheduling period. A goal programming model utilizes these personnel requirements to generate a shift schedule, allowing the decision maker a choice in establishing scheduling priorities. Priorities can be established for workforce levels in particular periods (from two distinct points of reference), full-time workforce levels, and part-time workforce levels. By varying priority relationships, different shift schedules result. A computer simulation model is included to evaluate the schedule generated by the goal program. The results of the simulation provide the decision maker with schedule performance information. Based upon this information, the scheduler can accept the schedule, revise the schedule, or revise certain model parameters and cycle back through the solution process. The flexibility of the scheduling model is illustrated through example priority formulations and a sample scheduling problem.

ISSN:0740-817X    

DOI:10.1080/07408178408975248

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

This paper reviews several goal programming extensions to the Linear Decision Rule Formulation of the Aggregate Production Planning Problem, and presents an extension using Polynomial Goal Programming. Employing a well known problem as a point of reference, the solution of the various model formulations is illustrated using commercially available mathematical programming software.

ISSN:0740-817X    

DOI:10.1080/07408178408975249

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

The conventional approach to the modeling and solution of most scheduling problems involves the development of a mathematical model which (1) employs discrete variables (e.g., linear integer programs), and (2) includes only a single objective to be maximized or minimized (e.g., minimization of makespan). Unfortunately, models involving discrete variables are inherently combinatorially explosive (i.e., methods such as branch-and-bound will exhibit computation times which grow exponentially with problem size). Further, scheduling problems encountered in the real world invariably involve multiple conflicting objectives, and thus using a single-objective representation can lead to gross oversimplification. In this paper we address a specific class of scheduling problem encountered in several real-world applications that may be efficiently addressed as a linear multiobjective model having only continuous variables. The model and its solution are compared with those of a highly acclaimed recent approach, and they appear to provide significant improvements.

ISSN:0740-817X    

DOI:10.1080/07408178408975250

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

This paper is concerned with a production planning problem of allocating production items to production shifts on production lines in a multiple objective decision environment. The problem is modeled and solutions are generated using integer goal programming techniques. Objectives are formulated not only in terms of minimizing the sum of deviations from goal target levels, but also in terms of minimizing the maximum deviation. Test results indicate that the model structure and solution process utilized can provide decision makers with a good set of representative solutions in a rather complex multiple objective decision environment.

ISSN:0740-817X    

DOI:10.1080/07408178408975251

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

Travel-time models are developed for automated storage/retrieval (AS/R) machines. The S/R machine travels simultaneously horizontally and vertically as it moves along a storage aisle. For randomized storage conditions expected travel times are determined for both single and dual command cycles. Alternative input/output (I/O) locations are considered. Additionally, various dwell-point strategies for the storage/retrieval machine are examined.

ISSN:0740-817X    

DOI:10.1080/07408178408975252

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

When the cost of reducing the duration of activities is convex and nonlinear, it may be advisable (to reduce the computing burden) to seek a “satisficing” answer, in which the project is compressed to a desired completion time with a prespecified tolerable relative error. We treat the problem of constructing the optimal first degree interpolating linear spline that guarantees such maximal error and consider various possible refinements.

ISSN:0740-817X    

DOI:10.1080/07408178408975253

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

In this paper a model is presented for determination of the expected annual total cost of inventory for a multi-level inventory system. The model permits identification of the safety stock levels needed to minimize the expected annual total cost for a multi-level inventory system, such as distributed warehouses. An example of the application of the model is given.

ISSN:0740-817X    

DOI:10.1080/07408178408975254

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

Analysis of the part selection policy in the case of a flexible manufacturing cell producing different parts for several emanating lines is presented. The discrete response control problem is formulated as an undiscounted semi-Markovian decision problem whose decision epochs occur when the cell completes a part and must decide what type of part to fabricate next. Design objective is to minimize the expected shortage penalty per unit time incurred by the production lines when they run out of inputs. Optimal production policies are characterized, and a discussion of related industrial implementation issues is given.

ISSN:0740-817X    

DOI:10.1080/07408178408975255

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor

摘要:

This paper presents a stepwise partial enumeration algorithm for determining the economic lot schedule of a multiproduct single facility system on a repetitive basis. The algorithm is based on a simple “sufficient feasibility” test. The algorithm starts from a feasible schedule determined from the common cycle solution and continues stepwise partial enumerations to improve the schedule until no appreciable improvement occurs. Performance of the algorithm is demonstrated by solving six problems recently solved by Haessler. The algorithm gives better or equal solutions to the problems.

ISSN:0740-817X    

DOI:10.1080/07408178408975256

出版商:Taylor & Francis Group    

年代:1984

数据来源: Taylor