A branch and bound for single machine stochastic scheduling to minimize the maximum lateness ,
This paper studies the problem of single machine stochastic scheduling with random processing times, deterministic due dates and an independent setup time. The jobs are also deteriorated based on the position, which their processes are done. The objective function is to find a schedule of jobs, whic...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2012-04-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Subjects: | |
| Online Access: | http://www.growingscience.com/ijiec/Vol3/IJIEC_2012_10.pdf |