Premium
MULTIPLE OBJECTIVES IN LINEAR PROGRAMMING –AN EXAMPLE IN SCHEDULING POSTAL RESOURCES
Author(s) -
Ritzman Larry P.,
Krajewski Leroy J.
Publication year - 1973
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1973.tb00562.x
Subject(s) - computer science , scheduling (production processes) , operations research , overtime , linear programming , mathematical optimization , integer programming , job shop scheduling , industrial engineering , schedule , algorithm , mathematics , engineering , economics , labour economics , operating system
This paper describes a methodology to treat multiple objectives in a mathematical programming problem. A linear programming model is developed for the short‐term manpower scheduling problem in a post office so as to get a desirable balance between mail transit times and resource expenditures. The scheduling problem is of particular interest because of 1) the multiplicity of objectives, 2) the existence of several mail classes, each having different arrival patterns, routings, and dispatch times, and 3) the complexity of the different scheduling options available. The paper demonstrates how the model can be used experimentally to obtain model parameters which, in the judgment of management, achieve a desirable balance between objectives. Once the parameters are determined, the model prescribes how to vary the overtime usage, reassign workers to the various work stations, and adjust the priorities of the mail classes. The model has indirect use in studying the effects of changing work capacities, dispatch schedules, and mail arrival patterns.