Job-shop scheduling with multi-purpose machines
β Scribed by P. Brucker; R. Schlie
- Publisher
- Springer Vienna
- Year
- 1990
- Tongue
- English
- Weight
- 314 KB
- Volume
- 45
- Category
- Article
- ISSN
- 0010-485X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper considers the simulation-based analysis of dispatching rules for scheduling in dynamic job shops taking into account interruptions on the shop Β―oor. With respect to Β―owtime and due date-based objectives, the relative performance of well-known, recently proposed as well as some new dispatc
## The objective of this paper is to develop polynomial algorithms for the open shop makespan problem. It is shown that when a machine majorizes all other machines and the ith largest processing time on that machine is at least as large as the processing times of all operations on machines i throu