{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:41:01Z","timestamp":1760197261512,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,5,7]],"date-time":"2018-05-07T00:00:00Z","timestamp":1525651200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We consider a single machine scheduling problem with uncertain durations of the given jobs. The objective function is minimizing the sum of the job completion times. We apply the stability approach to the considered uncertain scheduling problem using a relative perimeter of the optimality box as a stability measure of the optimal job permutation. We investigated properties of the optimality box and developed algorithms for constructing job permutations that have the largest relative perimeters of the optimality box. Computational results for constructing such permutations showed that they provided the average error less than    0 . 74 %    for the solved uncertain problems.<\/jats:p>","DOI":"10.3390\/a11050066","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T02:48:08Z","timestamp":1525747688000},"page":"66","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Single Machine Scheduling Problem with Interval Processing Times and Total Completion Time Objective"],"prefix":"10.3390","volume":"11","author":[{"given":"Yuri N.","family":"Sotskov","sequence":"first","affiliation":[{"name":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street 6, Minsk 220012, Belarus"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalja G.","family":"Egorova","sequence":"additional","affiliation":[{"name":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street 6, Minsk 220012, Belarus"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,5,7]]},"reference":[{"key":"ref_1","first-page":"101","article-title":"A real-time production scheduler for a stochastic manufacturing environment","volume":"1","author":"Davis","year":"1988","journal-title":"Int. J. Prod. Res."},{"key":"ref_2","unstructured":"Pinedo, M. (2002). Scheduling: Theory, Algorithms, and Systems, Prentice-Hall."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.41.2.363","article-title":"Robust scheduling to hedge against processing time uncertainty in single stage production","volume":"41","author":"Daniels","year":"1995","journal-title":"Manag. Sci."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1080\/09511920802209033","article-title":"Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research","volume":"22","author":"Sabuncuoglu","year":"2009","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"ref_5","unstructured":"Sotskov, Y.N., and Werner, F. (2014). Sequencing and Scheduling with Inaccurate Data, Nova Science Publishers."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2015.08.010","article-title":"The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective","volume":"66","author":"Pereira","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1080\/00207549408956978","article-title":"Dispatching rules in scheduling: A fuzzy approach","volume":"32","author":"Grabot","year":"1994","journal-title":"Int. J. Prod. Res."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TFUZZ.2011.2159982","article-title":"Possibilistic minmax regret sequencing problems with fuzzy parameteres","volume":"19","author":"Kasperski","year":"2011","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0377-2217(97)00445-1","article-title":"Optimal fuzzy counterparts of scheduling rules","volume":"113","author":"Duckstein","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"4381","DOI":"10.1080\/00207540210159527","article-title":"Stability of Johnson\u2019s schedule with respect to limited machine availability","volume":"40","author":"Braun","year":"2002","journal-title":"Int. J. Prod. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1016\/j.mcm.2009.03.006","article-title":"Minimizing total weighted flow time of a set of jobs with interval processing times","volume":"50","author":"Sotskov","year":"2009","journal-title":"Math. Comput. Model."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/j.cor.2011.02.001","article-title":"Minimizing total weighted flow time under uncertainty using dominance and a stability box","volume":"39","author":"Sotskov","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_13","first-page":"287","article-title":"Optimization and Approximation in Deterministic Sequencing and Scheduling","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discret. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Nav. Res. Logist. Q."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lai, T.-C., Sotskov, Y.N., Egorova, N.G., and Werner, F. The optimality box in uncertain data for minimising the sum of the weighted job completion times. Int. J. Prod. Res., 2017.","DOI":"10.1080\/00207543.2017.1398426"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.cie.2015.04.024","article-title":"Techniques to effectively buffer schedules in the face of uncertainties","volume":"87","author":"Burdett","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1080\/07408170701283198","article-title":"Robustness and stability measures for scheduling: Single-machine environment","volume":"40","author":"Goren","year":"2008","journal-title":"IIE Trans."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.orl.2007.11.004","article-title":"A 2-approximation algorithm for interval data minmax regret sequencing problems with total flow time criterion","volume":"36","author":"Kasperski","year":"2008","journal-title":"Oper. Res. Lett."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., and Yu, G. (1997). Robust Discrete Optimization and Its Application, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"1682","DOI":"10.1016\/j.cor.2011.10.003","article-title":"Robust scheduling on a single machine total flow time","volume":"39","author":"Lu","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1013333232691","article-title":"On the robust single machine scheduling problem","volume":"6","author":"Yang","year":"2002","journal-title":"J. Comb. Optim."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10700-004-5870-9","article-title":"Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date","volume":"4","author":"Harikrishnan","year":"2005","journal-title":"Fuzzy Optim. Decis. Mak."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.cor.2014.06.003","article-title":"Single machine scheduling problem with interval processing times to minimize mean weighted completion times","volume":"51","author":"Allahverdi","year":"2014","journal-title":"Comput. Oper. Res."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/5\/66\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:03:34Z","timestamp":1760195014000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/5\/66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,7]]},"references-count":23,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["a11050066"],"URL":"https:\/\/doi.org\/10.3390\/a11050066","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,5,7]]}}}