RT - Journal Article
T1 - Minimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
JF - IUST
YR - 2018
JO - IUST
VO - 29
IS - 1
UR - http://ijiepr.iust.ac.ir/article-1-689-en.html
SP - 15
EP - 34
K1 - single machine
K1 - flexible periodic availability constraints
K1 - bimodal
K1 - tardy jobs
K1 - branch-and-bound.
AB - In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the duration of unavailability for each period depends on the maximum continuous working time of the machine in that same period, again with two different values allowed. The objective is to minimize the number of tardy jobs. In the first stage, the complexity of the problem is investigated and a binary integer programming model, a heuristic algorithm and a branch-and-bound algorithm are proposed in a second stage. Computational results of solving 1680 sample problems indicate that the branch-and-bound algorithm is capable of not only solving problems of up to 20 jobs but also of optimally solving 94.76% of the total number of problems. Based on numerical results obtained, a mean average error of 2% is obtained for the heuristic algorithm.
LA eng
UL http://ijiepr.iust.ac.ir/article-1-689-en.html
M3 10.22068/ijiepr.29.1.15
ER -