haku: @author Hariri, A. M. A. / yhteensä: 2
viite: 1 / 2
« edellinen | seuraava »
| Tekijä: | Hariri, A. M. A. Potts, C. N. |
| Otsikko: | A Branch and Bound Algorithm to Minimize the Number of Late Jobs in a Permutation Flow-Shop |
| Lehti: | European Journal of Operational Research
1989 : VOL. 38:2, p.228-237 |
| Asiasana: | OPTIMIZATION MATHEMATICAL PROGRAMMING MIXED INTEGER PROGRAMMING |
| Kieli: | eng |
| Tiivistelmä: | The problem of scheduling n jobs in an m-machine permutation flow-shop is considered. Each job is to be processed on machines 1,...,m in that order. The processing order of jobs has to be the same for each machine. For each job a due date is given. The objective is to schedule the jobs as to minimize the number of late jobs. By solving a single machine subproblem a lower bound is obtained. In addition, two improvements are developed and a branch and bound algorithm based on these lower bounds is described. |
« edellinen | seuraava »
SCIMA