We study a deterministic problem of evaluating the worst case performance of flexible solutions in the single machine scheduling. A flexible solution is a set of schedules following a given structure determined by a partial order of jobs and a type of the schedules. In this paper, the schedules of active and non-delay type are considered. A flexible solution can be used on-line to absorb the impact of data disturbances related to, for example, job arrival, tool availability or machine breakdowns. The performance of a flexible solution includes the best case and the worst case performances. The best case performance is an ideal performance that can be achieved only if the on-line conditions allow to implement the best schedule of the set of schedules characterizing the flexible solution. In contrast, the worst case performance indicates how poorly the flexible solution may perform when following the given structure in the on-line circumstances. The best-case and the worst-case performances are usually evaluated by the minimum and maximum values of the considered objective function, respectively. We present algorithmic and computational complexity results for some maximization scheduling problems. In these problems, the jobs to be scheduled have different release dates and precedence constraints may be given on the set of jobs.
@article{RO_2007__41_1_1_0,
author = {Aloulou, Mohamed Ali and Kovalyov, Mikhail Y. and Portmann, Marie-Claude},
title = {Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {1--18},
publisher = {EDP-Sciences},
volume = {41},
number = {1},
year = {2007},
doi = {10.1051/ro:20070012},
mrnumber = {2310536},
language = {en},
url = {http://archive.numdam.org/articles/10.1051/ro:20070012/}
}
TY - JOUR AU - Aloulou, Mohamed Ali AU - Kovalyov, Mikhail Y. AU - Portmann, Marie-Claude TI - Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2007 SP - 1 EP - 18 VL - 41 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro:20070012/ DO - 10.1051/ro:20070012 LA - en ID - RO_2007__41_1_1_0 ER -
%0 Journal Article %A Aloulou, Mohamed Ali %A Kovalyov, Mikhail Y. %A Portmann, Marie-Claude %T Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity %J RAIRO - Operations Research - Recherche Opérationnelle %D 2007 %P 1-18 %V 41 %N 1 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro:20070012/ %R 10.1051/ro:20070012 %G en %F RO_2007__41_1_1_0
Aloulou, Mohamed Ali; Kovalyov, Mikhail Y.; Portmann, Marie-Claude. Evaluating flexible solutions in single machine scheduling via objective function maximization : the study of computational complexity. RAIRO - Operations Research - Recherche Opérationnelle, Tome 41 (2007) no. 1, pp. 1-18. doi : 10.1051/ro:20070012. http://archive.numdam.org/articles/10.1051/ro:20070012/
[1] , On the reactive scheduling design using flexible predictive schedules, in Proceedings of IEEE SMC'2002, 6 pages in CD-ROM, Hammamet, October 2002.
[2] , and, Maximization problems in single machine scheduling. Ann. Oper. Res. 129 (2004) 21-35. | Zbl
[3] and, An efficient proactive reactive approach to hedge against shop flow disruptions, in Multidisciplinary Scheduling: Thoery and Applications, edited by G. Kendall, E. Burke, S. Petrovic and M. Gendreau, Springer (2005) 223-246. | Zbl
[4] , and, Maximization of solution flexibility for robust shop scheduling. Eur. J. Oper. Res. 165 (2005) 314-328. | Zbl
[5] , and, Characterization of a set of schedules in a resource constrained multi-project scheduling problem with multiple modes. Inter. J. Industrial Eng. Applications Practice 6 (1999) 112-122.
[6] , Introduction to sequencing and scheduling. John Wiley and Sons (1974).
[7] , Scheduling algorithms. Springer-Verlag (1998). | MR | Zbl
[8] and, Complexity results for scheduling problems. http://www.mathematik.uni-osnabrueck.de/research/OR/class/ (2003).
[9] and, Robust scheduling to hedge against processing time uncertainty in single stage production. Manage. Sci. 41 (1995) 363-376. | Zbl
[10] and, Computers and Intractability: A Guide to the Theory of NP-Completeness, edited by W.H. Freeman (1979). | MR | Zbl
[11] ,, and, Optimization and approximation in deterministic machine scheduling: a survey. Ann. Discrete Math. 5 (1979) 287-326. | Zbl
[12] and, Project scheduling under uncertainty: survey and research potentials. Eur. J. Oper. Res. 165 (2005) 289-306. | Zbl
[13] , Scheduling a single machine to minimize the number of late jobs. Technical report, Computer Science Division, University of California, Berkeley, USA (1983).
[14] and, Predictable scheduling of a single machine subject to breakdowns. Inter. J. Compu. Integrated Manufacturing 12 (1999) 15-38.
[15] , Reducibility among weighted completion time scheduling problems. Ann. Oper. Res. (1990) 91-101. | Zbl
[16] , Various optimizers for single-stage production. Naval Research Logistics Quarterly 3 (1956) 59-66.
[17] , and, Scheduling Theory. Single-Stage Systems. Kluwer Academic Publishers (1994). | MR | Zbl
[18] , and, A graph-theoretic decomposition of the job shop scheduling problem to achieve scheduling robustness. Oper. Res. 47 (1999) 113-124. | Zbl
Cité par Sources :
