Working time constraints in operational fixed job scheduling

In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs efficient bounding procedures and dominance properties. We conduct a numerical experiment to observe the effects of parameters on the quality of the solution. The results of our computational tests for the branch-and-bound algorithm reveal that our algorithm can solve the instances with up to 100 jobs in reasonable times. To the best of our knowledge our branch-and-bound algorithm is the first optimisation attempt to solve the problem.

[1]  Frits C. R. Spieksma,et al.  Interval scheduling: A survey , 2007 .

[2]  Ulrich Faigle,et al.  A Greedy On-Line Algorithm for thek-Track Assignment Problem , 1999, J. Algorithms.

[3]  Leo Kroon,et al.  Exact and approximation algorithms for the operational fixed interval scheduling problem , 1995 .

[4]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Matteo Fischetti,et al.  Approximation Algorithms for Fixed Job Schedule Problems , 1992, Oper. Res..

[7]  Hamilton Emmons,et al.  Interval Scheduling on identical machines , 1996, J. Glob. Optim..

[8]  William J. Wolfe,et al.  Three Scheduling Algorithms Applied to the Earth Observing Systems Domain , 2000 .

[9]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Working-Time Constraints , 1989, Oper. Res..

[10]  Leo Kroon,et al.  On the computational complexity of (maximum) class scheduling , 1991 .

[11]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[12]  Deniz Türsel Eliiyi,et al.  Spread time considerations in operational fixed job scheduling , 2006 .

[13]  Klaus Jansen,et al.  Approximation Algorithms for Time Constrained Scheduling , 1997, Inf. Comput..

[14]  Matteo Fischetti,et al.  The Fixed Job Schedule Problem with Spread-Time Constraints , 1987, Oper. Res..

[15]  F. Spieksma.  On the approximability of an interval scheduling problem , 1999 .

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  Paolo Toth,et al.  A heuristic approach to the bus driver scheduling problem , 1986 .