Scheduling in a contaminated area: A model and polynomial algorithms |
| |
| Institution: | 1. Institute of Engineering Cybernetics, Wroclaw University of Technology, Janiszewskiego 11/17, 50-372 Wroclaw, Poland;2. Faculty of Economics, Belarus State University, United Institute of Informatics Problems, Skarini 4, 220050 Minsk, Belarus;1. Central Institute for Labour Protection - National Research Institute, Department of Personal Protective Equipment, Lodz, Poland;2. Central Institute for Labour Protection - National Research Institute, Department of Chemical, Biological and Aerosol Hazards, Warsaw, Poland;1. College of Power Engineering, Naval University of Engineering, Wuhan, 430033, China;2. State Key Laboratory of Hydroscience and Engineering, Department of Energy and Power Engineering, Tsinghua University, Beijing, 100084, China |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
