On-the-job problems require communication, flexible leadership
β Scribed by Nancy L Mehaffy
- Book ID
- 117003715
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 159 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0001-2092
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A parallel approach to flexible job shop scheduling problem is presented in this paper. We propose two double-level parallel metaheuristic algorithms based on the new method of the neighborhood determination. Algorithms proposed here include two major modules: the machine selection module refer to e
The exible job shop problem is an extension of the classical job shop scheduling problem which allows an operation to be performed by one machine out of a set of machines. The problem is to assign each operation to a machine (routing problem) and to order the operations on the machines (sequencing p