TitleStable scheduling of single machine with probabilistic parameters
Journal titleBulletin of the Polish Academy of Sciences: Technical Sciences
Divisions of PASNauki Techniczne
PublisherPolish Academy of Sciences
IdentifierISSN 0239-7528, eISSN 2300-1917
ReferencesAlidee (1997), A note on minimizing the weighted sum of tardy and early completion penalties in a single machine of Operational Research, Journal, 96, 559. ; Li (1998), Stochastic single machine scheduling to minimize the weighted number of tardy jobs eds Fuzzy Information and Engineering, AISC, 363. ; Kirlik (2012), A variable neighbourhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine Computers, Operatins Research, 39, 1506. ; Cai (2005), Single - machine scheduling with expotential processing times and general stochastic cost functions of, Journal Global Optimization, 31, 317, doi.org/10.1007/s10898-004-5702-z ; Soroush (2007), Minimizing the weighted number of early and tardy jobs in a stochasic single machine scheduling problem of, European Journal Operational Research, 181. ; Potts (1985), A branch and bound algorithm for the total weighted tardiness problem, Operations Research, 33, 177, doi.org/10.1287/opre.33.2.363 ; Wodecki (2009), A block approach to earliness - tardiness scheduling problems on Advanced Manufacturing Technology, International Journal, 40, 797. ; Crauwels (1998), Local search heuristics for the single machine total weighted tardiness scheduling problem on, INFORMS Journal Computing, 10, 341, doi.org/10.1287/ijoc.10.3.341 ; Hu (null), A new model for single machine scheduling with uncertain processing time of, Journal Intelligent Manufacturing, doi.org/10.1007/s1084501510339,1-9(2015) ; Den Basten (2001), Design of iterated local search algoritms An example application to the single machine total weighted tardiness problem eds in, Lecture Notes Computer Science, 2037. ; Lann (1996), Single machine scheduling to minimize the number of early and tardy jobs and, Computers Operations Research, 23, 769, doi.org/10.1016/0305-0548(95)00078-X ; Bożejko (2006), Block approach - tabu search algorithm for single machine total weighted tardiness problem &, Computers Industrial Engineering, 50, 1, doi.org/10.1016/j.cie.2005.12.001 ; Van (2008), den Akker Minimizing the number of late jobs in a stochastic setting using a chance constraint, Journal of Scheduling, 11, 59, doi.org/10.1007/s10951-007-0034-8 ; Bożejko (2010), Parallel path relinking method for the single machine total weighted tardiness problem with sequence - dependent setups of, Journal Intelligent Manufacturing, 21, 777, doi.org/10.1007/s10845-009-0253-2 ; Lenstra (1977), Complexity of machine scheduling problems of, Annals Discrete Mathematics, 1, 343, doi.org/10.1016/S0167-5060(08)70743-X ; Bożejko (2007), On the theoretical properties of swap multimoves, Operations Research Letters, 35, 227, doi.org/10.1016/j.orl.2006.03.002 ; Li (1998), Stochastic scheduling on a repairable machine with Erlang uptime distribution in, Advances Applied Probability, 30, 1073, doi.org/10.1017/S0001867800008806 ; Soroush (2006), Single machine scheduling with stochastic processing times or stochastic due - dates to minimize the number of early and tardy jobs of, International Journal Operations Research, 3, 90. ; Potts (1991), Single machine tardiness sequencing heuristics, IIE Transactions, 23, 346, doi.org/10.1080/07408179108963868 ; Mazdeh (2012), Solving a single machine stochastic scheduling problem using a branch and bound algorithm and simulated annealing of and, International Journal Management Science Engineering Management, 7, 110. ; Jang (2002), Dynamic scheduling of stochastic jobs a single machine of, European Journal Operational Research, 138.