Local search in combinatorial optimization, 1997. ,
Solving Flow Shop Problem by Parallel Simulated Annealing, LNCS, pp.236-244, 2002. ,
On the theoretical properties of swap multimoves, Operations Research Letters, pp.227-231, 2007. ,
Scheduling Problem with Uncertain Parameters in, Just in Time System, pp.456-467, 2014. ,
Approximation algorithms for stochastic scheduling problems, 2005. ,
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers & Operations Research, vol.31, issue.11, pp.1891-1909, 2004. ,
DOI : 10.1016/S0305-0548(03)00145-X
Minimizing the expected number of tardy jobs when processing times are normally distributed, Operations Research Letters, vol.30, issue.2, pp.100-106, 2002. ,
DOI : 10.1016/S0167-6377(02)00110-4
A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, vol.91, issue.1, pp.160-175, 1996. ,
DOI : 10.1016/0377-2217(95)00037-2
Stability of scheduling with random processing times on one machine, Applicationes Mathematicae, vol.39, issue.2, pp.169-183, 2012. ,
DOI : 10.4064/am39-2-5
Minimizing Total Tardiness in a Hybrid Flexible Flowshop with Sequence Dependent Setup Times, INFOCOMP 2014: The fourth International Conference on Advanced Communications and Computation, pp.13-18 ,
Benchmarks for basic scheduling problems, European Journal of Operational Research, vol.64, issue.2, pp.278-285, 1993. ,
DOI : 10.1016/0377-2217(93)90182-M
Minimizing the number of late jobs in a stochastic setting using a??chance constraint, Journal of Scheduling, vol.15, issue.1, pp.59-69, 2008. ,
DOI : 10.1007/978-1-4684-2001-2_9
Probabilistic methods in combinatorial and stochastic optimization, 2005. ,
General stochastic single-machine scheduling with regular cost functions, Mathematical and Computer Modelling, vol.26, issue.3, pp.95-108, 1997. ,
DOI : 10.1016/S0895-7177(97)00134-9