Seyedhamed Mousavipour, Hiwa Farughi, Fardin Ahmadizar,
Volume 30, Issue 3 (9-2019)
Abstract
Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. Due to learning effects, jobs processing times are not fixed during plan horizon and each machine has predetermined number of preventive maintenance activities. A novel mixed integer linear programming model is proposed to formulate the problem for minimizing Make Span. Owing to the high complexity of the problem; we applied Grey Wolf Optimizer (GWO) and Invasive Weed Optimizer (IWO) to find nearly optimal solutions for medium and large instances. Finally, the computational Results are provided for evaluating the performance and effectiveness of the proposed solution approaches.
