Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases

Ying, Kuo-Ching; Lu, Chung-Cheng; Lin, Shih-Wei; Chen, Jie-Ning

doi:https://doi.org/10.1155/2017/7532174

Mathematical Problems in Engineering

On this page

Abstract Introduction Conclusions Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2017 | Article ID 7532174 | https://doi.org/10.1155/2017/7532174

Single-Machine Scheduling with Learning Effects and Maintenance: A Methodological Note on Some Polynomial-Time Solvable Cases

Kuo-Ching Ying,¹Chung-Cheng Lu,²Shih-Wei Lin,^3,4,5and Jie-Ning Chen⁶

Academic Editor: Josefa Mula

Received11 Mar 2017

Revised22 May 2017

Accepted21 Jun 2017

Published08 Aug 2017

Abstract

This work addresses four single-machine scheduling problems (SMSPs) with learning effects and variable maintenance activity. The processing times of the jobs are simultaneously determined by a decreasing function of their corresponding scheduled positions and the sum of the processing times of the already processed jobs. Maintenance activity must start before a deadline and its duration increases with the starting time of the maintenance activity. This work proposes a polynomial-time algorithm for optimally solving two SMSPs to minimize the total completion time and the total tardiness with a common due date.

1. Introduction

The single-machine scheduling problem (SMSP) is one of the most extensively studied classical scheduling problems owing to its wide range of applications in many realistic systems [1]. The excellent surveys of Abdul-Razaq et al. [2], Yen and Wan [3], Pinedo [4], and Adamu and Adewumi [5] have detailed the literature on the theory and applications of various SMSPs in the past several decades. Most SMSPs assume that job processing times are fixed and known throughout the process, and SMSPs with learning effects constitute a relatively new subfield in the area of scheduling.

Wright [6] scientifically examined the processing time of a single unit continuously decreasing with the processing of additional units in the aircraft industry; in the literature, this effect is known as the learning effect. Gawiejnowicz [7] was probably the first researcher who applied the learning effect to scheduling problems. Since learning effects are common in both manufacturing and service sectors, many studies have been devoted to investigating it following the pioneering work of Gawiejnowicz [7]. Depending on the production environment, learning effects can be classified into two categories [8]: position-based learning effects and the sum-of-processing-times-based learning effects. The former depend only on the number of jobs being processed; the latter depend on the sum of the normal processing times of the already processed jobs.

With respect to position-based learning effects, Biskup [9] modified the original power formula, , to formulate the basic position-based learning model, , where is the actual processing time of job if it is scheduled in position (); denotes the processing time of the first unit; represents the normal processing time of job , and is the learning index, which depends on the learning rate (LR). Biskup demonstrated that the SMSP with basic position-based learning and the goal of minimizing total completion times can be optimally solved in polynomial time by using the shortest processing time (SPT) rule. Since then, many studies of SMSPs with various performance measures have been performed using the basic position-based learning model of Biskup [9]. The most well-known ones include those of Mosheiov [10, 11], Lee et al. [12], Bachman and Janiak [13], Zhao et al. [14], Kuo and Yang [15], and Wu et al. [16]. Some extensions of the basic position-based learning model have been presented, including the consideration of job-dependent position-based learning effects [17–19], autonomous position-based and induced learning effects [20], position-based learning and deteriorating effects [21, 22], and position-based linear learning effects [13, 23, 24]. In all of the aforementioned position-based learning models, the actual processing time of a job decreases as its scheduled position increases.

With respect to sum-of-processing-time-based learning effects, Kuo and Yang [25, 26] were among the pioneers that considered the processing times of jobs that had already been preprocessed and proposed two learning models, and , for SMSPs with time-dependent learning. Yang and Kuo [27] later developed another model, , that is based on the sum of actual processing times, . Koulamas and Kyparisis [28] also proposed a sum-of-processing-time-based learning model for SMSPs: , where is the learning index. Based on this model, Biskup [8] indicated that the gains from learning are extremely high and suggested that would be more appropriate. Wang [29] considered an SMSP with the learning model that was developed by Koulamas and Kyparisis and proved that an optimal schedule that minimizes the sum of the square completion times can be obtained using the SPT rule. All of the aforementioned sum-of-processing-time-based learning models have in common the fact that the actual processing time of a job cannot be calculated without data on the normal or actual processing times of its preceding jobs, so the analysis is more difficult than that based on position-based learning models. An excellent survey by Biskup presents more detailed discussions regarding SMSPs with learning effects [8].

Both position-based learning and sum-of-processing-times-based learning approaches are valid and numerous practical examples of each have been presented. Biskup [8] indicated that position-based learning usually involves operations that are independent of processing time, such as the setting up of machines, while sum-of-processing-times-based learning generally involves the experience that is gained by workers who are involved in the jobs. However, in some situations, position-based learning and sum-of-processing-times-based learning exist simultaneously, such as those that involve a robot with a neural network system, as is used in many assembly lines and has been discussed by Lee and Wu [30]. This fact has motivated recent studies [30–35] that consider both learning effects at once. SMSPs with position-based learning and/or the sum-of-processing-times-based learning have also been studied from different perspectives to develop models that are as realistic as possible [36–40].

Since the 1990s, the scheduling of jobs with fixed maintenance [41] or variable maintenance [42] in a manufacturing system has attracted much attention. For scheduling with fixed maintenance, the starting time and the maintenance duration are fixed and given in advance. In scheduling with variable maintenance, the starting time is set by the scheduler, and the maintenance duration is a nondecreasing function of the starting time [43]. For a comprehensive survey, refer to Ma et al. [43]. SMSPs with learning and maintenance commonly arise in realistic manufacturing systems. If learning and maintenance simultaneously occur in an SMSP, then they will critically and enormously influence scheduling. However, learning effects and maintenance activity have seldom been simultaneously studied in relation to SMSPs.

To incorporate more practically important factors into scheduling, this work proposes a polynomial-time algorithm for solving two SMSPs, which takes into account both learning effects and variable maintenance activity. The objectives are to minimize the total completion time and the total tardiness with a common due date. The remainder of this paper is organized as follows. Section 2 defines the four SMSPs that are considered herein. Section 3 elucidates in detail the proposed polynomial-time algorithm. Finally, Section 4 concludes by offering recommendations for future studies.

2. Problem Definition

The SMSPs of interest are characterized by a set, , of independent jobs that are nonpreemptively processed on a single machine. All jobs are available for processing at the beginning of the planning horizon, which is time zero. Each job () has a normal processing time (without any learning effects), , if the job is sequenced first in a schedule. The following learning model, proposed by Low and Lin [36], applies generally to practical SMSPs.where is the actual processing time of job if it is sequenced in position in a schedule; and are the learning indices, and is the normal processing time of the job in position . In (1), the actual processing time of a job is simultaneously influenced by the traditional sum-of-processing-time-based learning effect, , and the general position-based learning effect, . Equation (1) clearly reveals that position-based learning and sum-of-processing-times-based learning are special cases with and , respectively.

The machine can handle only one job at a time and is continuously available during the planning horizon, except for the mandatory variable maintenance activity, which is performed at the beginning of the planning horizon or between two consecutive processed jobs; in that case, the starting time of the maintenance activity, s, must precede a specified deadline, (i.e., ). Notably, the maintenance activity cannot be performed after the completion time of the final job (i.e., ), because if it were so, the variable maintenance activity would effectively be neglected. The duration of maintenance for a given schedule , , is a positive and nondecreasing function of its starting time : and for all .

For a given schedule, let be the completion time of job , . The tardiness of job () is , where is the due date of job . The objective is to determine the starting time of the maintenance activity and the sequence of all jobs that optimize the total completion time () and the total tardiness () with a common due date, respectively. According to the three-field classification scheme of Graham et al. [44], the two SMSPs of interest are represented as and , respectively, where 1 denotes the SMSP; stands for the variable maintenance, and stands for learning effects.

It is important to note that the SMSP with the total flow time, , and identical release dates, , is equivalent to the SMSP with the total completion time, ; that is, , so the problem is equivalent to the problem. Besides, the SMSP with the mean lateness, , is also equivalent to the SMSP with the total completion time, ; that is, (where ). Therefore, the problem as well as the problem is equivalent to the problem. Hence, the proposed polynomial-time algorithm can also be used for optimally solving these equivalent SMSPs.

3. Polynomial-Time Algorithm

The following three theorems provide obvious properties for sequencing an optimal schedule in the two SMSPs under study.

Theorem 1. In the problem, there exists an optimal schedule that is obtained by sequencing jobs in the SPT order.

Theorem 2. In the problem, there exists an optimal schedule that is obtained by sequencing jobs in the SPT order.

Proof. The maintenance activity is carried out among a pair of consecutive jobs. The job interchange method can easily be used to reveal that the optimal schedules in the and problems are those consistent with the SPT order. Here, only two jobs, and , which are scheduled before and after the maintenance activity, are considered. Their schedule is denoted as . The positions of jobs and can be swapped, keeping the other jobs in the same positions, to generate a new schedule, . If , then the duration of the maintenance activity is lower in , , because the maintenance activity in will start before that in . Therefore, the completion time of job in will be less than the completion time of job in , so . Based on these results, the proofs of Theorems 1 and 2 are as follows.

Proof of Theorem 1. Let and denote the sums of the completion times of jobs and in and , respectively. Now,Substituting , , and into (2) yields Let ; then, Since , , , and , . Thus, is an increasing function.
Let ; now, , for , , and .
Since , for , is increasing for , , and . Therefore, , and .
Therefore, for , , , and . Hence, is an increasing function for , , , and . Since , for , , , and , so the first term in (3) is nonnegative. Also, the second term in (3) if . Clearly, if , implying that the total completion time of is larger than that of , completing the proof of Theorem 1.

Proof of Theorem 2. Let and denote the average tardiness of jobs and in and , respectively. Now,Obviously, because if , implying that the total tardiness of is larger than that of , completing the proof of Theorem 2.

Based on Theorems 1 and 2, the following simple algorithm (named YLLC algorithm) is proposed to determine the optimal starting time of the variable maintenance activity and the sequences of all jobs in the two SMSPs of interest.

Algorithm YLLC

Step 1. Sort all jobs in the SPT order based on normal processing times to generate a sequence with , where () is the normal processing time of the job with the kth processing priority.

Step 2. Use (1) to calculate the actual processing time, (), of each job with the kth processing priority in .

Step 3. For a given deadline for the start of the maintenance activity, compute that satisfies .

Step 4. Construct the candidate schedules , , where is a dummy job. Select the optimal schedule among the candidate schedules, which has the lowest objective function value.

Notably, proof of Theorem 1 also reveals the existence of an optimal schedule to the problem, which is obtained by sequencing jobs in the SPT order. Hence, the optimal solution to the problem can also be obtained by using the proposed YLLC algorithm. However, the criteria of maximum lateness and the makespan with release dates are not considered in this study because the SMSP with anyone of these criteria are strongly NP-hard even with simple linear position learning models (without maintenance) [45].

Theorem 3. Algorithm YLLC solves the and problems in time.

Proof. Sort the jobs using the SPT rule, requiring time. Given the SPT order and a starting time of the maintenance activity, the objective function value of a candidate schedules can be computed in time. The maximum number of possible starting times for maintenance is , so the objective function value is computed not more than times. Hence, algorithm YLLC solves each of the four SMSPs in time.

4. Conclusions and Recommendations for Future Studies

Learning effects and maintenance activity are critical factors in many scheduling environments but have seldom been studied in relation to SMSPs. In an attempt to address real-world situations, this work considered two SMSPs with learning effects and variable maintenance activity. The objectives were to minimize the total completion time and the total tardiness. An algorithm for solving the two SMSPs was developed, and the SMSPs were thus proved to be solvable in polynomial time with the explicit consideration of learning and the variable maintenance. According to the results, the developed algorithm is useful to practitioners in guiding them to solve the relevant SMSPs.

The SMSP with learning effects and variable maintenance is not purely hypothetical but arises in real scheduling decisions. It will continue to attract the attention of researchers and practitioners. This study suggests various potential directions for further research. First, the proposed algorithm could be extended to solve SMSPs with more general functions of learning effects as well as with the aging/deteriorating effect. Second, different objective functions for the SMSP with learning effects and maintenance considerations should be considered in the light of the results herein. Third, an SMSP with learning effects and maintenance in which a biobjective function value is minimized would be an interesting topic of research. Fourth, an SMSP with learning effects and multiple variable maintenance activities during the planning horizon would also be an interesting topic of research. Finally, extending the problems to the jobs with different release dates or due dates would be complex but warrants further works.

Conflicts of Interest

There are no conflicts of interest regarding the publication of this paper.

Acknowledgments

The first author of the work acknowledges the Ministry of Science and Technology of Taiwan for financially supporting this research, Grant MOST106-2221-E-027-085. The corresponding author of the work acknowledges the Ministry of Science and Technology of Taiwan and the Linkou Chang Gung Memorial Hospital for financially supporting this research, Grants MOST105-2410-H-182-009-MY2 and CMRPD3G0011, respectively.

References

C.-C. Lu, K.-C. Ying, and S.-W. Lin, “Robust single machine scheduling for minimizing total flow time in the presence of uncertain processing times,” Computers and Industrial Engineering, vol. 74, no. 1, pp. 102–110, 2014.
View at: Publisher Site | Google Scholar
T. S. Abdul-Razaq, C. N. Potts, and L. N. Van Wassenhove, “A survey of algorithms for the single machine total weighted tardiness scheduling problem,” Discrete Applied Mathematics. The Journal of Combinatorial Algorithms, Informatics and Computational Sciences, vol. 26, no. 2-3, pp. 235–253, 1990.
View at: Publisher Site | Google Scholar | MathSciNet
B. P.-C. Yen and G. Wan, “Single machine bicriteria scheduling: a survey,” International Journal of Industrial Engineering: Theory Applications and Practice, vol. 10, no. 3, pp. 222–231, 2003.
View at: Google Scholar
M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Springer, New York, NY, USA, 2012.
View at: Publisher Site | MathSciNet
M. O. Adamu and A. O. Adewumi, “A survey of single machine scheduling to minimize weighted number of tardy jobs,” Journal of Industrial and Management Optimization, vol. 10, no. 1, pp. 219–241, 2014.
View at: Publisher Site | Google Scholar | MathSciNet
T. P. Wright, “Factors affecting the cost of airplanes,” Journal of the Aeronautical Sciences, vol. 3, no. 4, pp. 122–128, 1936.
View at: Publisher Site | Google Scholar
S. a. Gawiejnowicz, “A note on scheduling on a single processor with speed dependent on a number of executed jobs,” Information Processing Letters, vol. 57, no. 6, pp. 297–300, 1996.
View at: Publisher Site | Google Scholar | MathSciNet
D. Biskup, “A state-of-the-art review on scheduling with learning effects,” European Journal of Operational Research, vol. 188, no. 2, pp. 315–329, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
D. Biskup, “Single-machine scheduling with learning considerations,” European Journal of Operational Research, vol. 115, no. 1, pp. 173–178, 1999.
View at: Publisher Site | Google Scholar
G. Mosheiov, “Scheduling problems with a learning effect,” European Journal of Operational Research, vol. 132, no. 3, pp. 687–693, 2001.
View at: Publisher Site | Google Scholar | MathSciNet
G. Mosheiov, “Parallel machine scheduling with a learning effect,” Journal of the Operational Research Society, vol. 52, no. 10, pp. 1165–1169, 2001.
View at: Publisher Site | Google Scholar
W.-C. Lee, C.-C. Wu, and H.-J. Sung, “A bi-criterion single-machine scheduling problem with learning considerations,” Acta Informatica, vol. 40, no. 4, pp. 303–315, 2004.
View at: Publisher Site | Google Scholar | MathSciNet
A. Bachman and A. Janiak, “Scheduling jobs with position-dependentprocessing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 257–264, 2004.
View at: Publisher Site | Google Scholar
C. L. Zhao, Q. L. Zhang, and H. Y. Tang, “Machine scheduling problems with a learning effect,” Dynamics of Continuous, Discrete and Impulsive Systems, Series A: Mathematical Analysis, vol. 11, no. 5-6, pp. 741–750, 2004.
View at: Google Scholar
W.-H. Kuo and D.-L. Yang, “Single machine scheduling with past-sequence-dependent setup times and learning effects,” Information Processing Letters, vol. 102, no. 1, pp. 22–26, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
C. Wu, W. Lee, and T. Chen, “Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations,” Computers and Industrial Engineering, vol. 52, no. 1, pp. 124–132, 2007.
View at: Publisher Site | Google Scholar
G. Mosheiov and J. B. Sidney, “Scheduling with general job-dependent learning curves,” European Journal of Operational Research, vol. 147, no. 3, pp. 665–670, 2003.
View at: Publisher Site | Google Scholar | MathSciNet
G. Mosheiov and J. B. Sidney, “Note on scheduling with general learning curves to minimize the number of tardy jobs,” Journal of the Operational Research Society, vol. 56, no. 1, pp. 110–112, 2005.
View at: Publisher Site | Google Scholar
B. M. T. Lin, “Complexity results for single-machine scheduling with positional learning effects,” Journal of the Operational Research Society, vol. 58, no. 8, pp. 1099–1102, 2007.
View at: Publisher Site | Google Scholar
D. Biskup and D. Simons, “Common due date scheduling with autonomous and induced learning,” European Journal of Operational Research, vol. 159, no. 3, pp. 606–616, 2004.
View at: Publisher Site | Google Scholar | MathSciNet
J.-B. Wang, “A note on scheduling problems with learning effect and deteriorating jobs,” International Journal of Systems Science. Principles and Applications of Systems and Integration, vol. 37, no. 12, pp. 827–833, 2006.
View at: Publisher Site | Google Scholar | MathSciNet
J. Wang, “Single-machine scheduling problems with the effects of learning and deterioration,” Omega, vol. 35, no. 4, pp. 397–402, 2007.
View at: Publisher Site | Google Scholar
T. C. Cheng and G. Wang, “Single machine scheduling with learning effect considerations,” Annals of Operations Research, vol. 98, no. 1, pp. 273–290, 2000.
View at: Publisher Site | Google Scholar | MathSciNet
J.-B. Wang and Z.-Q. Xia, “Flow-shop scheduling with a learning effect,” Journal of the Operational Research Society, vol. 56, no. 11, pp. 1325–1330, 2005.
View at: Publisher Site | Google Scholar
W.-H. Kuo and D.-L. Yang, “Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect,” European Journal of Operational Research, vol. 174, no. 2, pp. 1184–1190, 2006.
View at: Publisher Site | Google Scholar | MathSciNet
W.-H. Kuo and D.-L. Yang, “Minimizing the makespan in a single machine scheduling problem with a time-based learning effect,” Information Processing Letters, vol. 97, no. 2, pp. 64–67, 2006.
View at: Publisher Site | Google Scholar | MathSciNet
D.-L. Yang and W.-H. Kuo, “Single-machine scheduling with an actual time-dependent learning effect,” Journal of the Operational Research Society, vol. 58, no. 10, pp. 1348–1353, 2007.
View at: Publisher Site | Google Scholar
C. Koulamas and G. J. Kyparisis, “Single-machine and two-machine flowshop scheduling with general learning functions,” European Journal of Operational Research, vol. 178, no. 2, pp. 402–407, 2007.
View at: Publisher Site | Google Scholar | MathSciNet
J.-B. Wang, “Single-machine scheduling with general learning functions,” Computers & Mathematics with Applications. An International Journal, vol. 56, no. 8, pp. 1941–1947, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
W.-C. Lee and C.-C. Wu, “Some single-machine and m-machine flowshop scheduling problems with learning considerations,” Information Sciences. An International Journal, vol. 179, no. 22, pp. 3885–3892, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
T. C. Cheng, C.-C. Wu, and W.-C. Lee, “Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects,” Information Sciences. An International Journal, vol. 178, no. 11, pp. 2476–2487, 2008.
View at: Publisher Site | Google Scholar | MathSciNet
C. C. Wu and W. C. Lee, “Single-machine and flowshop scheduling with a general learning effect model,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1553–1558, 2009.
View at: Google Scholar | MathSciNet
Y. Yin, D. Xu, K. Sun, and H. Li, “Some scheduling problems with general position-dependent and time-dependent learning effects,” Information Sciences. An International Journal, vol. 179, no. 14, pp. 2416–2425, 2009.
View at: Publisher Site | Google Scholar | MathSciNet
X. Zhang and G. Yan, “Machine scheduling problems with a general learning effect,” Mathematical and Computer Modelling, vol. 51, no. 1-2, pp. 84–90, 2010.
View at: Publisher Site | Google Scholar | MathSciNet
P.-J. Lai and W.-C. Lee, “Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects,” Omega, vol. 39, no. 5, pp. 467–471, 2011.
View at: Publisher Site | Google Scholar
C. Low and W.-Y. Lin, “Some scheduling problems with time-dependent learning effect and deteriorating jobs,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 37, no. 20-21, pp. 8865–8875, 2013.
View at: Publisher Site | Google Scholar | MathSciNet
C.-H. Wu, P.-J. Lai, and W.-C. Lee, “A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects,” Applied Mathematical Modelling. Simulation and Computation for Engineering and Environmental Systems, vol. 39, no. 2, pp. 415–424, 2015.
View at: Publisher Site | Google Scholar | MathSciNet
S.-C. Liu, W.-L. Hung, and C.-C. Wu, “Note on a single-machine scheduling problem with sum of processing times based learning and ready times,” Mathematical Problems in Engineering, vol. 2015, Article ID 452602, 9 pages, 2015.
View at: Publisher Site | Google Scholar | MathSciNet
Y.-B. Wu and J.-J. Wang, “Single-machine scheduling with truncated sum-of-processing-times-based learning effect including proportional delivery times,” Neural Computing and Applications, vol. 27, no. 4, pp. 937–943, 2016.
View at: Publisher Site | Google Scholar
A. Azadeh, H. Habibnejad-Ledari, S. Abdolhossein Zadeh, and M. Hosseinabadi Farahani, “A single-machine scheduling problem with learning effect, deterioration and non-monotonic time-dependent processing times,” International Journal of Computer Integrated Manufacturing, vol. 30, no. 2-3, pp. 292–304, 2016.
View at: Publisher Site | Google Scholar
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.
View at: Publisher Site | Google Scholar | MathSciNet
M. A. Kubzin and V. A. Strusevich, “Planning machine maintenance in two-machine shop scheduling,” Operations Research, vol. 54, no. 4, pp. 789–800, 2006.
View at: Publisher Site | Google Scholar
Y. Ma, C. B. Chu, and C. R. Zuo, “A survey of scheduling with deterministic machine availability constraints,” Computers and Industrial Engineering, vol. 58, no. 2, pp. 199–211, 2010.
View at: Publisher Site | Google Scholar
R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.
View at: Publisher Site | Google Scholar | MathSciNet
R. Rudek, “Scheduling problems with position dependent job processing times: computational complexity results,” Annals of Operations Research, vol. 196, pp. 491–516, 2012.
View at: Publisher Site | Google Scholar | MathSciNet

Copyright

Copyright © 2017 Kuo-Ching Ying et al. 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.

PDF Download Citation

Download other formats

Order printed copies

Views

2872

Downloads

874

Citations