Abstract
For an industrial application in the chemical industry, we were confronted with the planning of experiments, where human intervention of a chemist is required to handle the starting and termination of each of the experiments. This gives rise to a new type of scheduling problem, namely problems of finding schedules with time periods when the tasks can neither start nor finish. We consider in this paper the natural case of small periods where the duration of the periods is smaller than any processing time. This assumption corresponds to our chemical experiments lasting several days, whereas the operator unavailability periods are typically single days or week-ends. These problems are analyzed on a single machine with the makespan as criterion.
We first prove that, contrary to the case of machine unavailability periods, the problem with one small operator non-availability period can be solved in polynomial time. We then derive approximation and inapproximability results for the general case of k small unavailability periods, where k may be part of the input or k may be fixed. We consider in particular the practical case of periodic and equal small unavailability periods. We prove that all these problems become NP-hard if one has k≥2 small unavailability periods and the problems do not allow fully polynomial time approximation schemes (FPTAS) for k≥3. We then analyze list scheduling algorithms and establish their performance guarantee.
Similar content being viewed by others
References
Billaut, J.-C., & Sourd, F. (2009). Single machine scheduling with forbidden start times. 4OR, 7(1), 37–50.
Brauner, N., Finke, G., Lehoux-Lebacque, V., Rapine, C., Kellerer, H., Potts, C., & Strusevich, V. (2009). Operator non-availability periods. 4OR, 7(3), 239–253.
Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S. A., & Werner, F. (2002). Complexity results for parallel machine problems with a single server. Journal of Scheduling, 5, 429–457.
Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 244–257.
Hall, N. G., Potts, C., & Sriskandarajah, C. (2000). Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102, 223–243.
Ji, M., He, Y., & Cheng, T. C. E. (2007). Single-machine scheduling with periodic maintenance to minimize makespan. Computers & Operations Research, 34, 1764–1770.
Lebacque, V., Brauner, N., Celse, B., Finke, G., & Rapine, C. (2007). Planification d’expériences dans l’industrie chimique. In J.-F. Boujut, D. Llerena, & D. Brissaud (Eds.), Les systèmes de production: applications interdisciplinaires et mutations (pp. 21–32). Paris: Hermès-Lavoisier. ISBN978-2-7462-1819-2.
Lee, C.-Y. (1996). Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395–416.
Lee, C.-Y. (2004). Machine scheduling with availability constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 22-1–22-13). London: Chapman & Hall/CRC.
Leung, J. Y.-T., Dror, M., & Young, G. H. (2001). A note on an open-end bin packing problem. Journal of Scheduling, 4, 201–207.
Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers and Industrial Engineering, 58(2), 199–211.
Mauguière, P., Billaut, J.-C., & Bouquard, J.-L. (2005). New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling, 8, 211–231.
Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operations Research, 121(1), 1–15.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rapine, C., Brauner, N., Finke, G. et al. Single machine scheduling with small operator-non-availability periods. J Sched 15, 127–139 (2012). https://doi.org/10.1007/s10951-012-0269-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-012-0269-x