A Two-phase Algorithm for Multiple-Route Job Shop Scheduling Problem Subject to Makespan

چکیده مقاله

Multiple-route job shop scheduling problem (MRJSP) is a generalization of job shop scheduling problem in which each job may have more than one route for its production and the numbers of operations associated to the alternative routes of the job are not necessarily equal. MRJSP is recognized to be extremely difficult because of its combinatorial nature of integer optimization and the large size of the real problem, necessitating the use of heuristic approaches or dispatching rules for its solution. In this paper, mathematical formulation of MRJSP is first presented. Then, a two-phase algorithm is proposed to deal with the two major sub-problems in MRJSP, namely, the route selection and the sequencing sub-problems. In order to evaluate the effectiveness of the proposed algorithm, several problems (in small, medium, and large sizes) are designed and solved using the proposed algorithm. The problems are also solved using some other dispatching rules, and comparisons are provided. The computational results show that the proposed algorithm generates high-quality schedules in a timely fashion.