Page - 40 - in Algorithms for Scheduling Problems

Algorithms 2018,11, 66 10. Braun,O.; Lai, T.-C.; Schmidt, G.; Sotskov, Y.N. Stability of Johnson’s schedulewith respect to limited machineavailability. Int. J.Prod. Res. 2002,40, 4381–4400. [CrossRef] 11. Sotskov,Y.N.;Egorova,N.M.;Lai,T.-C.Minimizingtotalweightedflowtimeofasetof jobswith interval processingtimes.Math.Comput.Model. 2009,50, 556–573. [CrossRef] 12. Sotskov,Y.N.; Lai, T.-C.Minimizing totalweightedflowtimeunderuncertaintyusingdominanceanda stabilitybox.Comput.Oper. Res. 2012,39, 1271–1289. [CrossRef] 13. Graham,R.L.;Lawler,E.L.;Lenstra, J.K.;Kan,A.H.G.R.OptimizationandApproximation inDeterministic SequencingandScheduling.Ann.Discret. Appl.Math. 1979,5, 287–326. 14. Smith,W.E.Variousoptimizers forsingle-stageproduction.Nav.Res. Logist.Q.1956,3, 59–66. [CrossRef] 15. Lai,T.-C.;Sotskov,Y.N.;Egorova,N.G.;Werner,F.Theoptimalitybox inuncertaindata forminimisingthe sumof theweighted jobcompletiontimes. Int. J.Prod. Res. 2017. [CrossRef] 16. Burdett, R.L.; Kozan, E. Techniques to effectively buffer schedules in the face of uncertainties. Comput. Ind. Eng.2015,87, 16–29. [CrossRef] 17. Goren,S.; Sabuncuoglu, I.Robustnessandstabilitymeasures forscheduling: Single-machineenvironment. IIETrans. 2008,40, 66–83. [CrossRef] 18. Kasperski, A.; Zielinski, P. A 2-approximation algorithm for interval dataminmax regret sequencing problemswith totalflowtimecriterion.Oper. Res. Lett. 2008,36, 343–344. [CrossRef] 19. Kouvelis,P.;Yu,G.RobustDiscreteOptimizationand ItsApplication;KluwerAcademicPublishers: Boston, MA,USA,1997. 20. Lu,C.-C.;Lin,S.-W.;Ying,K.-C.Robustschedulingonasinglemachine totalflowtime.Comput.Oper. Res. 2012,39, 1682–1691. [CrossRef] 21. Yang, J.;Yu,G.Ontherobust singlemachineschedulingproblem. J.Comb.Optim. 2002,6, 17–33. [CrossRef] 22. Harikrishnan,K.K.; Ishii,H.Singlemachinebatchschedulingproblemwithresourcedependentsetupand processingtimein thepresenceof fuzzyduedate.FuzzyOptim.Decis.Mak. 2005,4, 141–147. [CrossRef] 23. Allahverdi,A.;Aydilek,H.;Aydilek,A.Singlemachineschedulingproblemwith intervalprocessingtimes tominimizemeanweightedcompletiontimes.Comput.Oper. Res. 2014,51, 200–207. [CrossRef] c©2018bytheauthors. LicenseeMDPI,Basel,Switzerland. Thisarticle isanopenaccess articledistributedunder the termsandconditionsof theCreativeCommonsAttribution (CCBY) license (http://creativecommons.org/licenses/by/4.0/). 40