Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures

Applied Soft Computing

Volumn 1, Issue 1, 2001, Pages 35-52

  Jensen, Mikkel T ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Flexibility; Job shop scheduling; Robustness; Stochastic scheduling

Indexed keywords

EID: 1642270229     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1568-4946(01)00005-9     Document Type: Article

References (5)

1. I. Al-Harkan, On merging sequencing and scheduling theory with genetic algorithms to solve stochastic job shops, Ph.D. Thesis, University of Oklahoma, OK, 1997.
2. C. Bierwirth, A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms, OR Spektrum 17 (1995).
3. C. Bierwirth, D.C. Mattfeld, Production scheduling and rescheduling with genetic algorithms, Evolutionary Computation 7 (1999).
4. J. Branke, Creating Robust Solutions by Means of Evolutionary Algorithms, Parallel Problem Solving From Nature V, Lecture Notes in Computer Science, Vol. 1498, Springer, New York, 1998, pp. 119-128.
5. M. Dell'Amico, M. Trubian, Applying tabu search to the job-shop scheduling problem, Annals of Operations Research 41 (1993) 231-252.