haku: @freeterm Fertigungsprogrammplanung / yhteensä: 47
viite: 36 / 47
| Tekijä: | Sawik, T. J. |
| Otsikko: | Scheduling flexible flow lines with no in-process buffers (Maschinenbelegungsplanung, mathematisches Modell) |
| Lehti: | International Journal of Production Research
1995 : MAY, VOL. 33:5, p. 1357-1367 |
| Asiasana: | |
| Vapaa asiasana: | FERTIGUNGSPROGRAMMPLANUNG |
| Kieli: | eng |
| Tiivistelmä: | An heuristic algorithm is proposed for scheduling a flexible flow line with no intermediate buffers. In the line different part types can be manufactured simultaneously, each of which is processed by at most one machine. Intermediate queues of parts waiting between the stages are not allowed. The problem objective is to minimize the makespan of the schedule for a set of part types selected for processing. The efficiency of the algorithm is tested on several groups of random test problems. |
SCIMA