Scheduling in a contaminated area: A model and polynomial algorithms

Abstract There are n jobs to be scheduled in a contaminated area. The jobs can be rescue, de-activation or cleaning works to be executed by a single worker in an area contaminated with radio-active or chemical materials. Precedence relations can be given on the set of jobs. An execution of each job can be preempted. However, the length of the minimal uninterrupted work period is given and it is the same for all jobs. Each work period for a job should be accompanied by a rest period whose length depends on the start time of the work period and its length. We focus on a short term planning problem. We show that this problem can be modelled by a scheduling problem with start time dependent job processing times. The dependency functions are exponentially decreasing ones. We also construct two polynomial time algorithms for the both cases—with and without precedence constraints.

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

[2]  Gur Mosheiov,et al.  Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[3]  Sushil K. Gupta,et al.  Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem , 1990 .

[4]  Bahram Alidaee,et al.  Scheduling with time dependent processing times: Review and extensions , 1999, J. Oper. Res. Soc..

[5]  S. Eilon.  ON A MECHANISTIC APPROACH TO FATIGUE AND REST PERIODS , 1964 .

[6]  McCORMACK Pd,et al.  Performance in a vigilance task as a function of interstimulus interval and interpolated rest. , 1958 .

[7]  G. L. Gentzler,et al.  Quantitative models for optimal rest period scheduling , 1977 .

[8]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[9]  Eugene L. Lawler,et al.  Optimal Sequencing of a Single Machine Subject to Precedence Constraints , 1973 .

[10]  Gur Mosheiov,et al.  Complexity analysis of job-shop scheduling with deteriorating jobs , 2002, Discret. Appl. Math..

[11]  P D McCORMACK.  Performance in a vigilance task as a function of interstimulus interval and interpolated rest. , 1958, Canadian journal of psychology.

[12]  S. Bechtold,et al.  Maximization of Labor Productivity Through Optimal Rest-Break Schedules , 1984 .

[13]  Stephen E. Bechtold,et al.  Optimal Scheduling of a Flexible-Duration Rest Period for a Work Group , 1993, Oper. Res..

[14]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[15]  Ben B. Morgan,et al.  Methodological issues in the assessment of sustained performance , 1985 .

[16]  Bahram Alidaee,et al.  A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions , 1990 .

[17]  Jan Karel Lenstra,et al.  Preemptive Scheduling of a Single Machine to Minimize Maximum Cost Subject to Release Dates and Precedence Constraints , 1983, Oper. Res..

[18]  Joseph Y.-T. Leung,et al.  Complexity of Scheduling Tasks with Time-Dependent Execution Times , 1993, Inf. Process. Lett..

[19]  S. Bechtold,et al.  Note-Optimal Work-Rest Scheduling with Exponential Work-Rate Decay , 1988 .

[20]  Sid Browne,et al.  Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..