Stable scheduling of single machine with probabilistic parameters
Open Access
- 1 April 2017
- journal article
- research article
- Published by Walter de Gruyter GmbH in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
- Vol. 65 (2) , 219-231
Abstract
We consider a stochastic variant of the single machine total weighted tardiness problem jobs parameters are independent random variables with normal or Erlang distributions. Since even deterministic problem is NP-hard, it is difficult to find global optimum for large instances in the reasonable run time. Therefore, we propose tabu search metaheuristics in this work. Computational experiments show that solutions obtained by the stochastic version of metaheuristics are more stable (i.e. resistant to data disturbance) than solutions generated by classic, deterministic version of the algorithm.Keywords
This publication has 11 references indexed in Scilit:
- Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setupsJournal of Intelligent Manufacturing, 2009
- Minimizing the number of late jobs in a stochastic setting using a chance constraintJournal of Scheduling, 2007
- On the theoretical properties of swap multimovesOperations Research Letters, 2007
- Block approach—tabu search algorithm for single machine total weighted tardiness problemComputers & Industrial Engineering, 2006
- Single-Machine Scheduling with Exponential Processing Times and General Stochastic Cost FunctionsJournal of Global Optimization, 2005
- Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling ProblemINFORMS Journal on Computing, 1998
- Single machine scheduling to minimize the number of early and tardy jobsComputers & Operations Research, 1996
- Single Machine Tardiness Sequencing HeuristicsIIE Transactions, 1991
- A Branch and Bound Algorithm for the Total Weighted Tardiness ProblemOperations Research, 1985
- Complexity of Machine Scheduling Problems1977