A Job Shop Scheduling Problem with Sequence-Dependent Setup Times Considering Position-Based Learning effects and Availability Constraints

Sequence-dependent setup times (sdsts) scheduling problems, learning effects, transportation times, and availability constraints are significant and appealing issues in production management. researchers often study these issues in isolation, and these constraints have rarely been considered together. the present paper investigated the sdsts job shop scheduling problem (jssp) with positionbased learning effects, job-dependent transportation times, and multiple preventive maintenance activities such that, as a result of the learning effects, the times required for processing the jobs were variable during the planning horizon, and each machine had a predetermined number of preventive maintenance activities. for the formulation of the problem in order to minimize makespan, a new mixed-integer linear programming (milp) model was proposed. since the problem was highly complex, grey wolf optimizer (gwo) and invasive weed optimizer (iwo) were employed so that near-optimal solutions to medium- and large-sized instances could be obtained. to evaluate the performance and effectiveness of the proposed solution methods, the computational results were used