Abstract A worker's satisfaction level on a production schedule is an important factor to sustain the worker's morale. An ideal production schedule for the worker accords with the worker's preferences for days off, overtime, and so on. However, production schedules may not always satisfy the worker's preferences, because the schedules must often satisfy job due dates. This paper describes a production scheduling problem which seeks to satisfy the worker's preferences under due-date constraints. A scheduling problem is considered with the objective of satisfying the worker's wishes on days off without overtime. The solution may not always satisfy all of the workers' preferences when the work loads are too heavy. Then a scheduling problem is analyzed which minimizes the total overtime necessary to satisfy all the workers' preferences. These scheduling problems are formulated as linear goal programming problems, and a numerical example is given.
[1]
Michael W. Carter,et al.
Work Force Size and Single Shift Schedules with Variable Demands
,
1985
.
[2]
Kenneth R. Baker,et al.
Workforce Allocation in Cyclical Scheduling Problems: A Survey
,
1976
.
[3]
Michael W. Carter,et al.
Staff Scheduling with Day-Off and Workstretch Constraints
,
1979
.
[4]
Hamilton Emmons,et al.
Off-Day Scheduling with Hierarchical Worker Categories
,
1991,
Oper. Res..
[5]
Hamilton Emmons.
Work-Force Scheduling with Cyclic Requirements and Constraints on Days Off, Weekends Off, and Work Stretch
,
1985
.