경영과학 (Korean Management Science Review)
- 제10권1호
- /
- Pages.171-192
- /
- 1993
- /
- 1225-1100(pISSN)
A resource-constrained job shop scheduling problem with general precedence constraints
- Ahn, Jaekyoung (Department of Industrial Engineering, Seoul National Polytechnic University)
- 발행 : 1993.06.01
초록
In this paper, a rule for dispatching operations, named the Most Dissimilar Resources (MDR) dispatching rule is presented. The MDR dispatching rule has been designed to maximize utilization of resources in a resource-constrained job shop with general precedence constraints. In shown that solving the above scheduling problem with the MDR dispatching rule is equivalent to multiple solving of the maximum clique problem. A graph theoretic approach is used to model the latter problem. The pairwise counting heuristic of computational time complexity O(n
키워드