The problem studied in this paper is the Transportation job shop problem with blocking and no wait constraints. This problem is an extension of the classical job shop problem that take into account transport operations and the absence of storage space between machines. We formulate the problem by means of a new disjunctive graph. We modelized blocking situations and described properties of partial schedule that lead to deadlock situations. The new disjunctive graph and deadlock situations properties served us to develop a greedy heuristics based on priority and avoiding blocking cycle rules. We also propose to resolve our problem by an exact method based on a Mixed Integer Linear Program (MILP). Computational results for a set of benchmarking tests are reported and the effectiveness of our methods are discussed.
展开▼
