Opportunistic coordination of operations in job shop production
✍ Scribed by Hans Corsten; Ralf Gössinger
- Book ID
- 117347789
- Publisher
- Elsevier Science
- Year
- 2004
- Tongue
- English
- Weight
- 241 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0166-4972
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The purpose of this paper is to solve multi-job order release problem whose objective is to minimize the sum of mean shop floor flow times (SFFTs) of orders subject to due-date constraint. A heuristic algorithn is proposed for the problem by ~i~ the load profile of the shop. The load profile is divi
We consider the multiprocessor job shop scheduling problem (JSP) with unrelated processors, an extension of the classical JSP. The precedence relations between the operations are given by an acyclic directed weighted graph, in which nodes represent operations and arcs represent precedence relations.