Abstract
In the paper we investigate an uncertain single machine total weighted tardiness problem where uncertainty of times of jobs execution and jobs deadlines are modeled by random variables with a normal distribution. We check the influence of applying elimination criteria to the robustness of the determined solutions. Results are very promising and encourage further research.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bożejko, W., Rajba, P., Wodecki, M.: Stable scheduling of single machine with probabilistic parameters. Bull. Pol. Acad. Sci. Tech. Sci. 65(2), 219–231 (2017)
Bożejko, W., Grabowski, J., Wodecki, M.: Block approach-tabu search algorithm for single machine total weighted tardiness problem. Comput. Ind. Eng. 50(1/2), 1–14 (2006)
Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)
Bożejko, W., Wodecki, M.: Parallel genetic algorithm for minimizing total weighted completion time. LNCS, vol. 3070. pp. 400–405 (2004)
Congram, R.K., Potts, C.N., Van de Velde, S.L.: An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J. Comput. 14(1), 52–67 (2002)
Crauwels, H.A.J., Potts, C.N., Van Wassenhove, L.N.: Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS J. Comput. 10(3), 341–350 (1998)
Grosso, A., Della, C.F., Tadei, R.: An enhanced dynasearch neighborhood for single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32(1), 68–72 (2004)
Jang, W., Klein, C.M.: Minimizing the expected number of tardy jobs when processing times are normally distributed. Oper. Res. Lett. 30, 100–106 (2002)
Kirlik, G., Oguz, C.: A variable neighbourhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Comput. Oper. Res. 39(7), 1506–1520 (2012)
Lenstra, J.K., Rinnoy Kan, A.G.H., Brucker, P.: Complexity of machine scheduling problems. Ann. Discret. Math. 1, 343–362 (1977)
OR-Library. http://www.brunel.ac.uk/~mastjjb/jeb/info.html
Pinedo, M.: Stochastic scheduling with release dates and due dates. Oper. Res. 31(3), 559–572 (2002)
Shaked, M., Shanthikumar, J.G. (eds.): Stochastic Order. Academic Press, San Diego (1994)
Van den Akker, M., Hoogeveen, H.: Minimizing the number of late jobs in a stochastic setting using a chance constraint. J. Sched. 11, 59–69 (2008)
Wodecki, M.: A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. J. Adv. Manuf. Technol. 37(9–10), 996–1004 (2007)
Acknowledgement
The paper was partially supported by the National Science Centre of Poland, grant OPUS no. DEC 2017/25/B/ST7/02181, and Wrocław University of Science and Technology and RUDN University, agreement no. O/01800/524/2017, project no. 45WB/0001/2017.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Bożejko, W., Rajba, P., Wodecki, M. (2019). Robustness of the Uncertain Single Machine Total Weighted Tardiness Problem with Elimination Criteria Applied. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) Contemporary Complex Systems and Their Dependability. DepCoS-RELCOMEX 2018. Advances in Intelligent Systems and Computing, vol 761. Springer, Cham. https://doi.org/10.1007/978-3-319-91446-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-91446-6_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-91445-9
Online ISBN: 978-3-319-91446-6
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)