Abstract
In this work stability of solutions determined by algorithms based on tabu search method for a certain (NP-hard) one-machine arrangement problem was examined. The times of tasks performance are deterministic and they also constitute random variables of the standard or the Erlang’s schedule. The best results were obtained when as a criterion to choose an element from the neighborhood convex combinations of the first and the second moments of the random goal function were accepted. In this way determined solutions are stable, i.e. little sensitive to parameters random changes.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Beasley, J.E.: OR-Library: distributing test problems by electronic qmail. Journal of the Operational Research Society 41, 1069–1072 (1990), http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Bożejko, W., Rajba, P., Wodecki, M.: Arrangement Algorithms Stability with Probabilistic Parameters of Tasks. In: Proceedings of the 14th International Asia Pacific Conference on Computer Aided System Theory, Sydney, Australia, February 6-8 (2012)
Bożejko, W., Grabowski, J., Wodecki, M.: Block approach-tabu search algorithm for single machine total weighted tardiness problem. Computers & Industrial Engineering 50, 1–14 (2006)
Cai, X., Zhou, X.: Single machine scheduling with expotential processing times and general stochastic cost functions. Journal of Global Optimization 31, 317–332 (2005)
Dean, B.C.: Approximation algorithms for stochastic scheduling problems. PhD thesis, MIT (2005)
Garey, M.R., Johnson, D.S.: Scheduling tasks with nonuniform deadlines on two processor. Journal of ACM 23, 461–467 (1976)
Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Computers and Operations Research 31, 1891–1909 (2004)
Grabowski, J., Wodecki, M.: A very fast tabu search algorithm the job shop problem. In: Rego, C., Alidaee, A. (eds.) Metaheuristic Optimization via Memory and Evolution; Tabu Search and Scatter Search, pp. 117–144. Kluwer Academic Publishers, Boston (2005)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics 5, 287–326 (1979)
Itoh, T., Ishii, H.: Fuzzy due-date scheduling problem with fuzzy processing times. Int. Trans. Oper. Res. 6, 639–647 (1999)
Józefowska, J.: Just-in-time scheduling. Springer, Berlin (2007)
Kise, H., Ibaraki, T., Mine, H.: A solvable case of the one-machine scheduling problem with ready times and due times. Operations Research 26, 121–126 (1978)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Millerand, R.E., Thatcher, J.W. (eds.) Complexity of Computations, pp. 85–103. Plenum Press, NY (1972)
Lawler, E.L., Moore, J.M.: A Functional Equation and its Applications to Resource Allocation and Sequencing Problems. Management Science 16, 77–84 (1969)
Lawler, E.L.: A ”pseudopolinomial” algorithm for sequencing jobsto minimize total tardiness. Annals of Discrete Mathematics 1, 331–342 (1977)
Lenstra, J.K., Rinnoy Kan, A.H.G.: Complexity results for scheduling chains on a single machine. European Journal of Operational Research 4, 270–275 (1980)
Monma, C.I.: Linear-time algorithms for scheduling on parallel processor. Operations Research 30, 116–124 (1982)
Moore, J.M.: An n-job, one machine sequencig algorithm for minimizing the number of late jobs. Menagement Science 15, 102–109 (1968)
Pinedo, M.: Stochastic scheduling with release dates. Operation Research 31, 559–572 (1983)
Potts, C.N., Van Wassenhove, L.N.: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. Operations Research 33, 177–181 (1985)
Potts, C.N., Van Wassenhove, L.N.: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs. Management Science 34(7), 843–858 (1988)
Prade, H.: Using fuzzy set theory in a scheduling problem. Fuzzy Sets and Systems 2, 153–165 (1979)
Sahni, S.K.: Algorithms for Scheduling Independent Jobs. J. Assoc. Comput. Match. 23, 116–127 (1976)
Smith, W.E.: Various Optimizers for Single-Stage Production. Naval Research Logist Quartely 3, 59–66 (1956)
Van den Akker, M., Hoogeveen, H.: Minimizing the number of late jobs in a stochastic setting usinga chance constraint. Journal of Scheduling 11, 59–69 (2008)
Sourd, F., Kedad-Sidhoum, S.A.: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem. Journal of Scheduling 11, 49–58 (2008)
Wodecki, M.: A Branch-and-Bound Parallel Algorithm for Single-Machine Total Weighted Tardiness Problem. J. Adv. Manuf. Tech. 37(9-10), 996–1004 (2008)
Wodecki, M.: A block approach to earliness-tardiness scheduling problems. Advanced Manufacturing Technology 40, 797–807 (2009)
Villareal, F.J., Bulfin, R.L.: Scheduling a Single Machine to Minimize the Weighted Number of Tardy Jobs. IEE Trans. 15, 337–343 (1983)
Vondrák, J.: Probabilistic methods in combinatorial and stochastic optimization. PhD thesis, MIT (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bożejko, W., Rajba, P., Wodecki, M. (2014). Stable Scheduling with Random Processing Times. In: Klempous, R., Nikodem, J., Jacak, W., Chaczko, Z. (eds) Advanced Methods and Applications in Computational Intelligence. Topics in Intelligent Engineering and Informatics, vol 6. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-01436-4_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-01436-4_4
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-01435-7
Online ISBN: 978-3-319-01436-4
eBook Packages: EngineeringEngineering (R0)