Modeling the Parallel Machine Scheduling Problem with Worker- and Position-Dependent Processing Times
Abstract
Traditional deterministic scheduling problems consider that processing times of jobs are fixed and constant over time. However, this assumption is not realistic in practice in hand-intensive manufacturing contexts. To deal with this, the current paper studies the deterioration effect of processing times on a parallel machine scheduling problem. In such a case, job processing times depend on the position of jobs in the execution sequence. The objective function is the minimization of the maximum delay of the set of jobs, that is the makespan. A mixed-integer linear programming model is provided for the basic case in which the processing time of jobs deteriorate only as a function of their position in the schedule. Then, two original extensions are proposed. The first one considers that both the position and the worker do impact the processing time, while in the second situation workers can have a break after a given period of time. Preliminary experiments are carried out to illustrate the impact of such situations on the objective function. Results are promising.
Origin | Files produced by the author(s) |
---|---|
licence |