haku: @author Pack, L. / yhteensä: 6
viite: 1 / 6
« edellinen | seuraava »
| Tekijä: | Pack, L. |
| Otsikko: | Zur Berücksichtigung von Rüstzeiten im klassischen Maschinenbelegungsproblem |
| Lehti: | Zeitschrift für Betriebswirtschaft
1998 : VOL. 68:5, p. 497-524 |
| Asiasana: | JOB-SHOP SCHEDULING HEURISTIC METHODS |
| Kieli: | ger |
| Tiivistelmä: | It is shown that set up- and change-over-times play an important role in the job-shop-scheduling problem and how they can be taken care of in finding the best schedule of jobs. To make the analysis as easy as possible the heuristic method of exchanging two jobs at a time is used to find the (relatively) best schedule. In order to include set up- and change-over-times it is necessary to distinguish three different kinds of such times according to if and how they may be done during idle times within the production process. For easy numerical examples, based on random production-, set-up- and change over-times it is shown that total time to finish a given number of jobs may be reducted up to 20 or even 30% as compared to a first- come-first-served schedule. |
« edellinen | seuraava »
SCIMA