Abstract
This paper tackles a stochastic version of single machine scheduling with random processing times and due dates. The objective function is to find a schedule of jobs which minimizes the weighted sum of earliness and tardiness penalties, taking into consideration probabilistic modelling of the tasks processing times. Since the problem is NP-hard, it is not possible to find optimal values for large scales of the problem in a reasonable run time, therefore, a tabu search meta-heuristic is provided. Computational experiments demonstrate that the proposed tabu search algorithm is strongly capable of finding near optimal stability solutions with a very low gap. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Bozejko, W., Rajba, P., & Wodecki, M. (2014). Scheduling problem with uncertain parameters in just in time system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8468 LNAI, pp. 456–467). Springer Verlag. https://doi.org/10.1007/978-3-319-07176-3_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
