Selection and scheduling of jobs with time-dependent duration

Abstract

In this paper two mathematical programming models, both with multiple objective
functions, are proposed to solve four related categories of job scheduling problems. All
four of these categories have the property that the duration of the jobs is dependent
on the time of implementation and in some cases the preceding job. Furthermore,
some jobs (restricted to subsets of the total pool of jobs) can, to different extents, run
in parallel. In addition, not all the jobs need necessarily be implemented during the
given time period.

Keywords: Scheduling, sequencing, 0/1 integer programming, time dependence of job duration.

ORiON Vol. 23 (1) 2007: pp. 17-28