Research Article | Open Access
Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint
Most scheduling problems are based on the assumption that machines work continuously during the planning horizon. This assumption is not true in many production environments because the machine may not be available during one or more periods such as during breakdowns or maintenance operations. In this paper, the problem of the single machine scheduling with one unavailability period and nonresumable jobs with the aim of minimizing the number of tardy jobs is studied. A number of theorems are proved and a heuristic procedure is developed to solve the problem. A branch-and-bound approach is also presented which includes upper and lower bounds and efficient dominance rules. Computational results for 2680 problem instances show that the branch-and-bound approach is capable of solving 98.7% of the instances optimally, bearing witness to the efficiency of the proposed procedure. Our results also indicate that the proposed approaches are more efficient when compared to other methods.
Most scheduling problems take the fact that the machine works continuously during the planning horizon for granted. This assumption may be unrealistic in many production environments as the machine becomes unavailable during breakdowns or maintenance operations.
The number of tardy jobs is one of the important objective functions in scheduling problems. This target has wide applications in many production and service environments and reflects factors of external cost based on due dates such as customer satisfaction. The number of tardy jobs can represent orders of customers that are not satisfied. In this paper, the single machine scheduling problem with a known unavailability period and nonresumable jobs with the objective of minimizing the number of tardy jobs is considered. According to Pinedo  separation, this problem is denoted by .
So far, a few researchers have studied single machine problems with availability constraints. In these problems, there are three general states for jobs including resumable, nonresumable, and semiresumable states. According to the resumable scenario, job preemption is allowed. This means that if a job cannot be finished before a nonavailability period of the machine, its processing can be resumed when the machine is available again. According to the nonresumable scenario, preemption is undesirable and the whole processing of the job should be repeated if it cannot be finished before the unavailability period. In the semiresumable state, part of the processing should be repeated if it cannot be finished before the nonavailability interval.
Lee  showed that the SPT rule, the EDD rule, and the Moore and Hodgson algorithm  minimize the targets of sum of completion times, maximum lateness, and the number of tardy jobs, respectively, in the single machine problem with a fixed nonavailability interval and resumable jobs. He also proved that the problem is NP-hard even if for all . In addition, he showed that the problem is NP-hard, too.
Adiri et al.  and Lee and Liman  proved that the problem is NP-hard. Lee and Liman  showed that the worst case boundary of the SPT rule for this problem was 9/7. Sadfi et al.  provided a heuristic algorithm called MSPT (modified SPT) to solve the problem and proved that this heuristic had a tight worst case boundary of 20/17. Breit  presented a parametric heuristic procedure with the time complexity for this problem and showed that the minimized calculated worst case boundary for this algorithm was 1.07.
Kacem and Chu  developed a set of lower bounds for the problem and compared them analytically. They also proposed three heuristic algorithms with the time complexity , with , and with . They finally presented a branch-and-bound algorithm to solve the problem in which the best solution of the heuristics , , and is used as the upper bound. Kacem  showed that heuristic proposed in  had a tight worst case boundary of 2. Kacem et al.  formulated a mixed integer programming (MIP) model for the problem . Then, they proposed some new lower bounds including analytic comparisons of them. Next, they presented a branch-and-bound algorithm based on these lower bounds and proposed a dynamic programming procedure to solve the problem optimally. Finally, via computational results, they analyzed the performances of the three exact methods of MIP model, branch-and-bound approach, and the dynamic programming provided in their paper.
Liao and Chen  proposed a heuristic algorithm with the time complexity , for the single machine problem with periodic maintenance operations and nonresumable jobs with the target of maximum tardiness. Then, they presented a branch-and-bound algorithm to achieve optimal schedules and utilized it to evaluate their heuristic.
Ji et al.  studied the problem of minimizing makespan on a single machine with periodic maintenance and nonresumable jobs. They showed that the worst case boundary of LPT rule for this problem was 2 and that it was tight. Additionally, they showed that there was no approximation algorithm with polynomial time and worst case performance less than 2 unless .
Chen  studied the problem of minimizing total flow time and maximum tardiness subject to periodic maintenance and nonresumable jobs. He provided a heuristic procedure with the time complexity to find efficient schedules of the linear target function , where and represent total flow time and maximum tardiness of schedule , respectively, and is the weighting factor. He also showed that the worst case boundary of this heuristic according to values and was between 1 and . He then developed a branch-and-bound algorithm to achieve optimal schedules and utilized it to examine schedules obtained through his heuristic.
Adiri et al.  assumed that the unavailable period is unknown but with a probabilistic distribution. They distinguished two cases of a breakdown, that is, the resumable and nonresumable cases. By applying the EDD and MSPT rules for two cases, respectively, the criterion of number of tardy jobs can be minimized. Chen  considered the problem of minimizing the number of tardy jobs subject to periodic maintenance and nonresumable jobs. He presented a heuristic algorithm with the time complexity . He then proposed a branch-and-bound approach to find optimal schedules and applied it for evaluating schedules obtained from his heuristic.
In the literature, the single machine scheduling with the target of minimizing the number of tardy jobs with an availability constraint has not been reported, specially by an efficient heuristic and a binary branch and bound in solving procedure, to the best of our knowledge. Therefore, in this paper, minimizing the number of tardy jobs in the single machine scheduling problem with a fixed nonavailability period, that is, problem , is studied. It is assumed that there is one unavailability interval with known beginning and finishing times, and all the jobs are nonresumable.
The rest of this paper is organized as follows. In Section 2, a definition of the problem is presented along with the notations and assumptions used. In Section 3, some theorems are proved to facilitate the solution of the problem. In Section 4, a heuristic procedure is developed for the problem. A branch-and-bound (BB) approach is proposed in Section 5 that aims at the optimal solution of the problem. Computational results for evaluating the heuristic and the BB algorithm are presented in Section 6. Also in this section, numerical results are used to make comparisons between the procedures proposed in this paper and the algorithms of Chen  for the special case of problems in which problems with periodic maintenance are transferred to problems with one nonavailability interval.
2. Problem Definition
The problem consists of scheduling jobs in the set on a single machine. The target is defined as minimizing the number of tardy jobs. Each job has a known processing time and a due date. All jobs are nonresumable and available at time zero. The machine is not available during the time interval of to and cannot process any job in this period. Outside this interval, the machine can process only one job at a time. The following notations are used for the problem: : number of jobs; : the set of jobs to be scheduled, ; : processing time of job , ; : due date of job , ; : beginning time of the nonavailability interval; : finishing time of the nonavailability interval; : completion time of job , ; : number of tardy jobs in the complete schedule.
It is assumed that data are integers. If all the jobs can be processed before the nonavailability interval, the problem will be changed to the single machine scheduling problem without any availability constraint whose optimal solution will be obtained by applying the Moore and Hodgson algorithm in a polynomial time. Therefore, this paper considers only problems in which not all the jobs can be inserted before the nonavailability period. In other words, the inequality always holds.
3. Theorems of the Problem
The problem was studied by Lee . He proved that the problem is NP-hard. He also showed that for the resumable case of the problem, that is, , the Moore and Hodgson algorithm can be applied to solve the problem optimally. For this case, the length of the maintenance period, , is added to completion times of those jobs that are finished after .
Lee  also showed that if the Moore and Hodgson algorithm was used for solving the problem , the inequality would always be true, in which denotes the number of tardy jobs obtained by the Moore and Hodgson algorithm and denotes the optimal number of tardy jobs.
The steps in the Moore and Hodgson algorithm are as follows:
Step 1. Put the jobs in the EDD order and index them in the same order.
Step 2. Calculate the tardiness of jobs. Notice that in the completion time of the jobs which are after the nonavailability period, the length of the time interval should be added. If there is no tardy job in the sequence obtained, this sequence would be optimal, stop. Otherwise, go to Step 3.
Step 3. Suppose that is the first tardy job in the sequence and select the job as follows: This job is removed from the sequence and is processed after all the nontardy jobs. Go to Step 2.
It is necessary to note that Lee  did not propose any procedure to solve the problem optimally. From the above considerations, we can conclude the following corollary.
Corollary 1. In view of the fact that the solution obtained from the Moore and Hodgson algorithm has at most one unit difference from the optimal solution, the value of can be considered as a lower bound for the problem .
According to Corollary 1, although the difference between Moore and Hodgson algorithm and optimal solution is at most one, in many practical cases, such as airline scheduling or hospital services scheduling, this difference is very important and it is so critical to recognize the optimal solution.
In the rest of this section, a number of theorems are proposed to solve the problem .
Theorem 2. In the problem , there is an optimal schedule in which jobs after and before the nonavailability interval are sequenced by the Moore and Hodgson algorithm.
Proof. Each sequence in the solution of the problem can be divided into two sets and , such that all the jobs in set are completed before and all the jobs in set are completed after . It is clear that the optimal solution of set is achieved based on the Moore and Hodgson algorithm.
On the other hand, it can be assumed that the ready times for all the jobs in are equal to , which entails that determining the optimal job sequence in this set is similar to minimizing the number of tardy jobs in a single machine with ready times equal to for all jobs. Therefore, the number of tardy jobs in can be minimized by applying the Moore and Hodgson algorithm.
Corollary 3. According to Theorem 2, the dominant set of sequences for the problem contains the ones in which each partial sequence before and after the nonavailability period is arranged by the Moore and Hodgson algorithm. Therefore, to devise a solution procedure for the problem, it suffices to develop algorithms that provide sequences with this property.
Theorem 4. In the problem , if there is a job such that , this job is always placed at the last position of the schedule.
Proof. Clearly, in the problem , the total completion time of all jobs is not less than . But perhaps due to the nonresumption assumption, there is some idle insert for the machine. Surely, the value of this idle insert is not greater than the maximum processing time of jobs minus one. So, completion times of jobs would not be greater than . Therefore, if the due date of a job is not less than this value, this job will not be a tardy one in any position of the schedule. Thus, placing this job at the last position of the schedule will not increase the number of tardy jobs.
Corollary 5 (Dominance Rule 1). At the beginning of each solution algorithm, Theorem 4 can be used as the dominance rule. Each time a job is placed at the last position of the schedule due to this rule, the solution space will be decreased by one unit.
Theorem 6. If the Moore and Hodgson algorithm is applied to the problem and if there is at least one tardy job before the unavailability period in the schedule obtained, this schedule is optimal.
Proof. Figure 1(a) shows the schedule obtained from the Moore and Hodgson algorithm for the problem . In this Figure, is the set of nontardy jobs before the unavailability period, is the tardy job before the unavailability period, is the preempted tardy job, and is the set of other tardy jobs. We know that this schedule is optimal for the problem . If we apply the Moore and Hodgson algorithm for the problem , a schedule illustrated in Figure 1(b) will be obtained. Clearly, the sequence of jobs in this case is similar to that in Figure 1(a) except for job which could not be finished before and has to start at time . According to Figures 1(a) and 1(b), the number of tardy jobs will be the same in both problems and . On the other hand, the optimal number of tardy jobs in problem is always equal or less than the optimal number of tardy jobs in problem . This is because, in the optimal schedule of the problem , if all the jobs after the nonavailability interval were shifted to the left so that the idle time before the unavailability period is filled, a feasible solution for the problem would be obtained in which the number of tardy jobs would not be more than the optimal number of tardy jobs in problem . Thus, the schedule shown in Figure 1(b) illustrates the optimal number of tardy jobs for the problem .
Corollary 7. According to Theorem 6, before applying any algorithm, the Moore and Hodgson algorithm can be used and its sequence can be achieved. If there is at least one tardy job before in this sequence, then this sequence is optimal. So, this approach may yield the optimal solution and there will be no need to apply any other algorithms to solve the problem.
Corollary 8. If the condition of Theorem 6 is not true for a problem, it means there is no tardy job before in the optimal schedule, so that, without losing optimality, the jobs before can be scheduled according to the EDD order. In other words, without satisfying the condition of Theorem 6, the dominant set would be scheduled in which the jobs before are not tardy and are arranged in the EDD order.
4. Heuristic H
In this section, a heuristic procedure is developed to solve the problem . In this heuristic, and are defined as the sequence obtained by heuristic H and the target value of this sequence, respectively. The steps in heuristic H are as follows.
Step 0. Begin.
Set , and .
Step 1. Calculate the value of this term:
Step 2. Check Dominance Rule 1.
If there is job such that , then go to Step 3. Otherwise, go to Step 4.
Step 3. Put job in position .
Set , , and ; if stop. Otherwise, return to Step 2.
Step 4. Put the jobs in set in the order of the Moore and Hodgson algorithm. Designate the achieved schedule as and the target value obtained through this sequence as .
If , the obtained schedule is optimal. Set and ; stop.
Step 5. Check Corollary 7.
If there is any tardy job before in the schedule , this schedule is optimal. Set and ; stop.
Step 6. Designate the set of jobs before as and the set of jobs after as .
Set , . Job , , is defined as the th job in set and job , , is defined as the th job in set . Put and .
Step 7. Job is the candidate for exchanging with job . If by eliminating job from the set , the possibility exists for job to be assigned before the nonavailability period, and the schedule is obtained by exchanging these two jobs in the schedule . Otherwise, go to Step 11.
Step 8. In the schedule , put the jobs before the nonavailability interval in the EDD order and arrange the set of jobs after the nonavailability interval based on the Moore and Hodgson algorithm.
Step 9. Check Corollary 8.
If there is at least one tardy job before the nonavailability interval, then this schedule will not be in the set of dominant solutions and will not be accepted; go to Step 11.
Step 10. Calculate the target value of schedule and designate it as .
If , then schedule is optimal. Set and ; stop.
Step 11. If , set and go to Step 7.
Step 12. If , set and ; stop. Otherwise, set and go to Step 7.
In summary, through Steps 1–3, the Dominance Rule 1 condition is checked for each job; by applying this rule for the jobs with this condition, the solution space is reduced. In Step 4, a feasible schedule is obtained by applying the Moore and Hodgson algorithm. In Step 5, the optimality condition of Corollary 7 is checked. If this condition is true, the schedule obtained will be optimal and the solution procedure will be stopped. If not, we try to improve the solution of Moore and Hodgson algorithm by a procedure of pairwise exchange. Since, according to Corollary 1, the solution obtained through the Moore and Hodgson algorithm has at most one tardy job in difference with the optimal solution, gaining the first improvement in this heuristic, therefore, and means achieving the optimal solution.
Example 9. As an illustration of the heuristic H, consider a single machine scheduling problem with seven jobs, as given in Table 1, where and .
Applying Steps 1–3, the jobs and are removed and placed at the end of schedule, as given in Table 2. In Step 4, the schedule , as shown in Table 3, is obtained, in which . Since the condition in Step 5 is not true for the achieved solution, according to Step 7, in the schedule , the job is exchanged with the job and the schedule , corresponding to Table 4, with , is achieved. Because the inequality is not satisfied, the exchanging process is continued. Finally, by exchanging the jobs and in , the schedule , as shown in Table 5, is obtained, in which , and since , we can conclude that the schedule () is optimal and, therefore, the solving procedure is stopped.
5. Branch-and-Bound Approach
According to the results stated above, a binary branch-and-bound (BB) is developed in this paper to solve problem . According to this algorithm, the basis of branching is assigning a job before or after the nonavailability interval. After any branching, the sets of jobs before and after the unavailability period are arranged based on the Moore and Hodgson algorithm. The search strategy in this procedure is backtracking. The following notations are used in the BB approach: : a partial sequence consisting of the set of scheduled jobs; : the set of unscheduled jobs which is complementary to ; : the set of jobs assigned before the unavailability period from time zero; : the set of nontardy jobs assigned after the unavailability period from time ; : the set of tardy jobs assigned after the unavailability interval and after the set ; : completion time of the set or the completion time of the last job scheduled before the unavailability interval; : completion time of the set or the completion time of the last job scheduled after the unavailability period; : idle time immediately before .
Assume that indices of the jobs are based on the EDD order and that this order determines the jobs’ priority for entering into the tree. The partial schedule consists of three sets as , , and . This schedule is shown in Figure 2. Jobs in the set are scheduled based on the EDD order before the nonavailability period from time zero. Jobs in the set are scheduled immediately after the nonavailability period, that is, at time , in the EDD order. Finally, jobs in the set are placed immediately after the set , that is, at the end of the schedule, in an optional order.
In the proposed BB, each time a job is added to a set of assigned jobs, two branches will be made. One of them refers to assigning the job before the nonavailability interval while the other refers to assigning it after the nonavailability interval.
If a job is assigned before the unavailability period, it will be added to the end of the set , but if it is assigned after the unavailability period, it will be assigned at the end of the jobs in the set . If it becomes a tardy job, by adding it in the set , the job with maximum processing time will be selected between this job and other jobs of the set and removed from the set to be added to the jobs in the set . Also, the value of the target function will be increased by one unit. In the rest of this section, the lower and upper bounds and some dominance rules will be presented for the BB procedure.
5.1. Upper Bound
In the proposed BB, heuristic H is executed first. According to the optimality conditions in heuristic H, if we recognize that the sequence obtained from this algorithm is optimal, then it will be considered as the optimal solution of the problem and the solution procedure will be stopped. Otherwise, the main algorithm of BB will be performed. In this case, the solution obtained through heuristic H will be considered as the upper bound of the problem.
5.2. Lower Bound
As mentioned earlier, if heuristic H cannot improve the solution obtained from the Moore and Hodgson algorithm, its value will be considered as an upper bound. In this state, and according to Corollary 1, by subtracting one tardy job from the upper bound, we can use it as a lower bound for problem . To obtain a lower bound for the partial sequence , the following theorem is used.
Theorem 10. In the problem , for a partial sequence , a lower bound is obtained from the following expression: in which is the number of tardy jobs in the schedule and is the number of tardy jobs in the set , while the jobs in the set are scheduled immediately after by the Moore and Hodgson algorithm assuming that resumption is allowed.
Proof. Clearly, in the partial schedule , the value is always fixed and independent of scheduling the jobs in the set . Also, we know that the starting time of jobs in the set is not earlier than . Now, if we ignore jobs after the unavailability period and schedule jobs in the set at time while assuming that resumption is allowed to obtain , the number of tardy jobs will in no way be smaller than no matter how the schedule is completed. So, the lower bound of the schedule is obtained from the sum of values and .
5.3. Dominance Rules
The following dominance rules are utilized in formulating our BB procedure.
Lemma 11 (Dominance Rule 2). In the BB tree, if a job assigned before the nonavailability period is tardy, this node will be fathomed and the search process will continue from other nodes and branches.
Proof. According to Corollary 8, if there is no tardy job in problem before the unavailability period in the solution obtained from the Moore and Hodgson algorithm, there will neither be any tardy jobs before in the optimal solution.
Lemma 12 (Dominance Rule 3). In the BB tree, if a job is decided to be assigned before the unavailability period, but there is no possibility for such assignment, this node will then be fathomed.
Proof. In fact, by assigning this job before the unavailability interval, an unfeasible solution will be obtained and there will be no need for continuing the search process from this node.
Lemma 13 (Dominance Rule 4). If the inequality condition holds in the partial schedule , all the jobs in set will be assigned after the nonavailability interval.
Proof. Regarding the available time before , that is, , it is clear that even the job with the smallest processing time cannot be inserted before the nonavailability period. So, all the jobs in this set will be added to the set and the Moore and Hodgson algorithm will be executed for this set.
6. Computational Results
In this section, a set of instances will be analyzed in order to evaluate the performance of heuristic H and the BB approach. These instances are generated and solved on a PIV PC with 3.4 GB CPU and 1 GB RAM in the Windows XP environment. In the rest of this section, the instance generation method and the analysis of the results will be presented. Then, comparisons will be made between the results obtained through these algorithms and those from Chen’s  algorithms.
6.1. Data Generation
Processing times for problem instances are randomly generated using the discrete uniform distribution in the range [1, 10]. According to [11, 13, 15], due dates are randomly generated from the discrete uniform distribution in the range , in which represents the range of due date factor and denotes the tardiness factor. Either of the two values 0.2 and 0.6 is assumed for the two parameters and . According to [8, 10], to evaluate the impact of start times of the non-availability period on the performance of algorithms, the values and are generated from the following data sets. Data set 1: and . Data set 2: and . Data set 3: and .
For the number of jobs, , the values are taken from 10 to 10000. For each possible combination of , , , and , 20 instances are randomly generated (). So, for all possible combinations of the start time of the unavailability period, tardiness factor, and due date factor 12 (2 × 2 × 3) series are generated with a total number of 2680 instances.
6.2. Numerical Results
Heuristic H and the BB procedure are coded in C++ programming language to solve the problem instances. For solving each problem through the BB approach, the time constraint of 4000 seconds is considered such that if the problem cannot be solved optimally within this time limit, the BB approach will be stopped for it.
Numerical results for 12 series are shown in Table 6, the symbol “>0” in the table reveals the 0.00 seconds computational time. In this table, the column “Number of optimal instances BB” shows the number of instances for each that are optimally solved by the BB approach. As shown here, except for the series , , and , optimal solutions are achieved for all instances in the others.
|Not reported instances could not be solved by BB approach in 4000 seconds.|
The column “Number of optimal instances H” shows the number of instances in which the solution obtained from algorithm H is optimal. The results indicate that optimal solutions are obtained for all instances by heuristic H in the series , , and and that this heuristic yields very good results in other series.
The column “Comp. time of BB” represents the minimum, average, and maximum times required to solve instances by the BB approach. It should be mentioned that because heuristic H is applied as an upper bound in the BB approach, its computation time is included in that of the BB approach. Additionally, because the computation time of heuristic H was 0.00 second to two decimals accuracy for all instances, the time required for applying the heuristic algorithm is not shown separately in this table.
Comparison of solution times for all instances reveals that the greatest computation times belong to the series , , and while the smallest ones belong to the series , , and .
From these observations, it can be inferred that the most difficult instances belong to the series and . Instances in these series have greater average times and fewer optimal solutions than the other series. The reason for this may be that the range for producing due dates in these series are smaller considering the values and and that there would be accordingly more equal due dates for different jobs. On the other hand, because is smaller, most jobs have tardiness due to their assignment after the nonavailability period. These will cause the Moore and Hodgson algorithm to be applied more for scheduling the jobs after the unavailability period.
Following the series and , the most difficult instances belong to the series . Considering the values and , the reason for this is that, in this series, firstly, the range of due dates is small; secondly, jobs have smaller due dates; and, finally, has its smallest value. In the instances of this series, therefore, most of the jobs are scheduled after the nonavailability period and, so, they are tardy ones. Hence, in this series the Moore and Hodgson algorithm is applied more frequently.
Columns related to “Number of optimal states in H” demonstrate the amount of instances in which the solution obtained by heuristic H is identified as optimal, and the solution procedure is, therefore, stopped. The column “Number of optimality states in H for D1” shows the number of instances in which the condition of Dominance Rule 1 is true for all jobs and, therefore, the optimal schedule is achieved by applying this rule and the solution process is stopped. The comparison of these columns reveals that this rule works rather properly in the instances with in the series , , and such that by applying this rule optimal solutions are obtained. This observation can be justified as follows: based on the values and , first of all, due dates are more scattered in these series and, secondly, the upper bound of the due date range is increased so that with the increasing the number of jobs, more jobs will satisfy the condition of Dominance Rule 1.
The column “Number of optimality states in H for C4” shows the number of instances in which the solution obtained through the Moore and Hodgson algorithm satisfies the optimality condition of the Moore and Hodgson algorithm in Corollary 7. In these instances, it is recognized that the solution obtained from the Moore and Hodgson algorithm is optimal, and the solution procedure is, therefore, stopped. These columns show that in the series and , the condition in Corollary 7 is true for all instances. This is because the dispersion of due dates in these series is high and the lower bound of the due date range is decreased. Also, is as high as possible in these series. In the series and , Corollary 7 has a quite proper application.
The column “Number of optimality states in H for others” shows the number of instances in which other conditions of optimality H are satisfied and thus the solution procedure is stopped.
In some series, all instances with problem sizes specified by the symbol “” reach optimal solutions by heuristic H before entering the BB tree; hence, the main BB algorithm is not executed for them.
Columns “Ave. Percent fathomed nodes” show the average number of nodes fathomed because of the dominance rules and the lower bound. In these columns, the terms D2, D3, D4, and LB refer to the Dominance Rules 2, 3, and 4, and the lower bound, respectively. Dominance Rule 2 works properly in the series and . This rule also has rather proper application in the series . The reason may be that, in these series, the value of is as low as possible and that, in the BB tree, there is a higher probability for the occurrence of states in which a tardy job is placed before the nonavailability interval.
The lower bound, , in all the series applied quite satisfactorily. In many instances, the very high efficiency of the lower bound left fewer opportunities for the dominance rules to apply.
Comparisons were made between the proposed algorithms and Chen’s  procedures to demonstrate the efficiency of our proposed algorithms. In the single machine problem, with periodic maintenance and nonresumable jobs, if the time between two consecutive maintenance periods is considered to be and the time length of each maintenance period is taken to be , this problem will be transferred to single machine problem with a nonavailability interval, with and . So, instances of the series , , , and will be solved via Chen’s  algorithms with the time constraint of 4000 seconds. Table 7 shows the results obtained from problem instances solved by Chen’s  algorithms. The components in this table are the same as those in Table 6.
It is clear from this table that, for instances with job sizes of 20, 30, 40, and 50 in the series , the BB algorithm proposed in  was not able to solve all the problems optimally, while the BB algorithm proposed in this paper was capable of optimally solving all the instances with identical sizes.
In the series , Chen’s  BB algorithm failed to optimally solve all the instances with job sizes of 20, 30, and 40. For instances, with , based on the assumption that the condition of Dominance Rule 1 holds true for all jobs in most instances, instances were solved more desirably by our proposed algorithm. For the series and our BB algorithm was clearly more efficient.
It should be mentioned that, for the problems with multiple unavailability periods, most of the dominance rules proposed in  apply properly to eliminate nodes. For this reason, all the instances in this paper in all series by up to a job size of 32 are solved optimally. In problems with a single unavailability period, however, these rules find fewer applications.
In this paper, the problem of single machine scheduling with one nonavailability period and the target of minimizing the number of tardy jobs was investigated. In this problem, the starting and finishing times of the nonavailability period are assumed to be given. It is further assumed that all the jobs are nonresumable and are available at time zero.
A number of theorems were proved for this problem, from which a heuristic and a branch-and-bound algorithm with bounds and some dominance rules were proposed. These procedures were tested on 12 series of problem instances. Computational results showed that, in most series, the branch-and-bound approach was capable of solving the problems up to a size of 1000 jobs. It was also observed that the dominance rules and the bounds of the proposed BB algorithm had satisfactory efficiency to eliminate nodes. Based on these results, it can be found that the heuristic H has a high efficiency to solve the problem. This efficiency is because of two reasons; firstly, this algorithm has achieved nearly optimal solutions in small-scale problems and has a little difference with BB approach in obtained results. Secondly, the algorithm has a very low response time to produce good solutions. The results of evaluating the efficiency of the proposed approach as compared with other procedures confirm the greater success of our proposed procedure.
For future study, it is suggested that other techniques of solving the problem optimally such as dynamic programming be investigated. Additionally, solving the problem in more general cases can be considered.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
- M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice Hall, New Jersey, NJ, USA, 2002.
- C.-Y. Lee, “Machine scheduling with an availability constraint,” Journal of Global Optimization, vol. 9, no. 3-4, pp. 395–416, 1996.
- J. B. Sidney, “An extension of Moore's due date algorithm,” in Symposium on the Theory of Scheduling and Its Applications, S. E. Elmaghrebi, Ed., Lecture Notes in Economics and Mathematical Systems, pp. 393–398, Springer, New York, NY, USA, 1973.
- I. Adiri, J. Bruno, E. Frostig, and A. H. G. Rinnooy Kan, “Single machine flow-time scheduling with a single breakdown,” Acta Informatica, vol. 26, no. 7, pp. 679–696, 1989.
- C. Y. Lee and S. D. Liman, “Single machine flow-time scheduling with scheduled maintenance,” Acta Informatica, vol. 29, no. 4, pp. 375–382, 1992.
- C. Sadfi, B. Penz, C. Rapine, J. Blazewicz, and P. Formanowicz, “An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints,” European Journal of Operational Research, vol. 161, no. 1, pp. 3–10, 2005.
- J. Breit, “Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint,” European Journal of Operational Research, vol. 183, no. 2, pp. 516–524, 2007.
- I. Kacem and C. Chu, “Efficient branch-and-bound algorithm for minimizing the weighted sum of completion times on a single machine with one availability constraint,” International Journal of Production Economics, vol. 112, no. 1, pp. 138–150, 2008.
- I. Kacem, “Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval,” Computers & Industrial Engineering, vol. 54, no. 3, pp. 401–410, 2008.
- I. Kacem, C. Chu, and A. Souissi, “Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times,” Computers & Operations Research, vol. 35, no. 3, pp. 827–844, 2008.
- C. J. Liao and W. J. Chen, “Single-machine scheduling with periodic maintenance and nonresumable jobs,” Computers and Operations Research, vol. 30, no. 9, pp. 1335–1347, 2003.
- M. Ji, Y. He, and T. C. E. Cheng, “Single-machine scheduling with periodic maintenance to minimize makespan,” Computers and Operations Research, vol. 34, no. 6, pp. 1764–1770, 2007.
- W.-J. Chen, “An efficient algorithm for scheduling jobs on a machine with periodic maintenance,” International Journal of Advanced Manufacturing Technology, vol. 34, no. 11-12, pp. 1173–1182, 2007.
- I. Adiri, E. Frostig, and A. H. G. Rinnooy Kan, “Scheduling on a single machine with a single breakdown to minimize stochastically the number of tardy jobs,” Naval Research Logistics, vol. 38, no. 2, pp. 261–271, 1991.
- W.-J. Chen, “Minimizing number of tardy jobs on a single machine subject to periodic maintenance,” Omega, vol. 37, no. 3, pp. 591–599, 2009.
Copyright © 2014 Ehsan Molaee and Ghasem Moslehi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.