- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 753123, 5 pages
Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect
School of Management, Guangdong University of Technology, Guangzhou, Guangdong 510520, China
Received 28 May 2013; Revised 1 August 2013; Accepted 2 August 2013
Academic Editor: Chin-Chia Wu
Copyright © 2013 Mingbao Cheng. 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.
We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect. The objective is to minimize the performance criteria of makespan and the total flow time. For the two-machine flow shop scheduling case, we show that Johnson’s rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect. Furthermore, by using the shortest total processing times first (STPT) rule, we construct the worst-case performance ratios for both criteria. Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.
Many researchers have studied flowshop scheduling problems under various assumptions and with different objective functions. Minimizing the makespan of the classical flowshop is known to be an NP-hard problem except for Johnson’s  two-machine case. Dannenbring , Gonzalez and Sahni , Smutnicki , and Cepek et al.  have developed approximation algorithms for some special cases of -machine flowshop problems.
In traditional machine scheduling theory, the processing time of a job is independent of its processed position. However, due to workers’ learning ability, working attitude, and their continuously improved skills with the passage of time, the processing time of a job is shorter if it is scheduled later in the production sequence. This phenomenon is known as a learning effect, which has been employed in management science since its discovery by Wright . Although the learning theory was first applied to industry more than 70 years ago, it remains an interesting important topic in scheduling research. Biskup  and Cheng and Wang  investigated the effect of learning in the framework of scheduling. Since then, scheduling with learning effect has received growing attention. Mosheiov  investigated Biskup’s learning effect model in various scheduling problems and through several examples showed that the optimal schedule is very different from that of the classical versions. Mosheiov and Sidney  considered a single-machine scheduling problem with job-dependent learning effects with objectives such as makespan and total flow time, which are proved to be polynomial-time solvable. Bachman and Janiak [11, 12] investigated several single machine scheduling problems with position-dependent processing time.
Many researchers have extended several kinds of learning effect model in machine scheduling problems. Wang  studied flowshop scheduling problems with job processing times dependent on their positions and suggested Johnson’s rule as a heuristic algorithm to analyze the worst-case ratio of the makespan and special cases of -machine flowshop. Wang and Xia  and Xu et al.  extended Biskup’s learning effect to minimize makespan and the total completion time in a flowshop setting. Biskup  provided an extensive review of scheduling with learning effects. Janiak and Rudek  considered a learning effect model in which the learning curve is S-shaped and provided NP-hard proofs for two cases of the problem to minimize the makespan. S.-J. Yang and D.-L. Yang  investigated a single-machine scheduling with a position-dependent aging effect described by a power function and variable maintenance duration. Li and Hsu  considered the case of two agents competing for a common single machine with learning effect. Lee et al.  studied a uniform parallel machine problem to jointly find an optimal assignment of operators to machines and an optimal schedule to minimize the makespan. Jiang et al.  introduced an actual time-dependent and job-dependent learning effect into single-machine scheduling problems. Wu et al.  proposed two truncated learning models in single-machine scheduling problems. The related literature also includes Koulamas and Kyparisis , Mosheiov , Janiak et al. , Lee and Wu , Huang et al. , Zhang and Yan , Koulamas , J.-B. Wang and J.-J. Wang , and Kuo  and further references.
We know that the model is proposed by Biskup , the effect for the given job processed in different positions is not stable; that is, if job is processed at th and th position, respectively, then , and the processing time decreases quickly if and far from zero. However, in many realistic settings, the learning process of workers should be stable, which is of utmost importance to guarantee the quality of the product. Therefore, we propose a position-dependent exponential learning effect model , where is a learning index. In such model, the processed position effect for a given job in some schedule is a constant because of , and the processing time decreases slowly if is near 1, and the proposed learning effect model can reflect reasonably the stability of the manufacturing process.
In this paper, we study permutation flowshop scheduling problems with a position-dependent exponential learning effect to minimize one of the following two regular performance criteria: makespan and the total flow time. An example is constructed to show that the classical Johnson rule is not optimal for the two-machine case with minimizing makespan under such a position-dependent exponential learning effect. We use the shortest total processing time first (STPT) rule (Dannenbring ) to solve our problem and obtain the same worst-case performance ratio for both criteria and prove this performance ratio to be tight. Furthermore, a polynomial-time algorithm is proposed for two special cases: identical processing times on all the machines for any given jobs and the flowshop scheduling problem with dominant machines.
The rest of the paper is organized as follows. In Section 2, we formalize the problem. We develop the worst-case performance ratios of the STPT algorithm and use it to solve our problem in Section 3. In Section 4, we analyze several special cases and prove that all the problems are solvable in polynomial time. Finally, concluding remarks are given in Section 5.
2. Formulation of the Problem
jobs are to be processed on an -machine flowshop. We assume that the normal processing time of job on machine is denoted as and the actual processing time of job on machine at the th position is denoted as . Namely, the actual processing time of a job is characterized by a position-dependent exponential function: , ; , where denotes the common learning index for all jobs. The aim in this paper is to find a schedule so that jobs should be processed on the machines to minimize a given objective function.
For a given schedule , represents the completion time of job , denotes the makespan, and denotes a schedule, where denotes a job that occupies the th position in . In the remaining part of this paper, all problems considered are denoted by the three-field notation scheme introduced by Graham et al. ; that is, , where .
3. Worst-Case Ratio for the General Case
It is well known that problems and are all strong NP-hard (Garey and Johnson ) even for . Johnson  proved that can be optimally solved by Johnson’s rule. However, in the following example, we show that this policy is not optimal for problem , where is a constant learning index.
Example 1. Let , , , , , , , , and learning index . The schedule given by Johnson’s rule is with the value . However, the optimal permutation schedule is , and the optimal value .
Before analyzing the worst-case ratio of the problems, we provide two lemmas. By simple interchange technique, the following results can be easily obtained.
Lemma 2. For problem , an optimal schedule can be obtained by shortest processing time first (SPT) rule.
Lemma 3. For problem , an optimal schedule can be obtained by SPT rule.
In the following, we turn our attention to obtain quasi-optimal schedule. For the problem, Dannenbring  gave the approximation algorithm shortest total processing time first (STPT) (a nondecreasing order of ) and showed that it has worst-case performance ratio .
Similarly, we use the STPT rule to construct an approximate algorithm for problem .
Theorem 4. If is an optimal schedule and is an STPT schedule for , then , and the bound is tight.
Proof. Without loss of generality, we assume that . Let be the completion time of job in schedule ; then we have and subsequently . Let be the optimal schedule. We will have ; hence, , and the term is minimized by the nondecreasing order of (Lemma 2 corresponding to the last machine). Therefore, we have .
We show that the bound is tight for the following example. Assume that there are jobs with normal processing times , and the learning index . Since for all jobs, the proposed heuristic may schedule the jobs in any order. Suppose that we process the jobs in the order of () on all machines. The makespan of is . The optimal schedule is , and the makespan of is . Hence, , and this bound is tight.
Similarly, we can use the STPT rule to put together an approximation algorithm for problem .
Theorem 5. Let be an optimal schedule, and let be the STPT schedule for ; then , and the bound is tight.
Proof. Without loss of generality, we assume that . Let be the completion time of job in the STPT schedule ; then and . Let be the optimal schedule. For , we have ; hence
while the term is minimized by the nondecreasing order of (Lemma 3 corresponding to the last machine). Consequently, we have that .
We now show that the bound is tight. Assume that there are machines and jobs with processing times , , , , ; , , , ; , , , , and the learning index . Since for all jobs, our heuristic may schedule the jobs in any order. Suppose that we arrange the jobs in the order of on machines. The cost of the schedule is . However, the optimal schedule is such a one in which the jobs are executed in the order of , and the cost is . Hence, . As approximates 1, we have .
4. Special Cases Solvable in Polynomial Time
We now consider the special case where a job has the same processing times on all machines for any given job; that is, . We know that for the problem, the completion time of is (Pinedo ), where denotes a schedule and denotes the job that occupies the th position in . Hence, for the problem, the completion time of is
Theorem 6. For problem , an optimal schedule can be obtained by the SPT rule.
Proof. Consider a schedule . Suppose that job occupy the th position in and that is defined accordingly. The schedule is obtained from the schedule by swapping jobs and . Assume that the schedule , in which , is optimal. The difference in makespan for the two schedules is given as follows: Since we have That is, , which contradicts our assumption that is an optimal schedule. Therefore, the schedule obtained by using the SPT rule is optimal.
Theorem 7. For problem , an optimal schedule can be obtained by the SPT rule.
Proof. The proof is similar to that of Theorem 6 and is omitted.
We now consider another special case. Assume that the flowshop has dominant machines. Following Ho and Gupta , machine is dominated by , or dominates iff (denoted by ). Refer to van den Nouweland et al.  and Cepek et al.  for such special cases.
For the dominant machine case, we form the machine in an increasing sequence of dominating machines (); that is, . Recall that for the problem with measure, the schedule has the completion time of job equal to (Pinedo ). Therefore, for the problem, the completion time of job is Therefore, an optimal algorithm can be developed as follows.
Step 1. Construct the SPT sequence of processing time , on machine . That is, .
Step 2. Let . Compute .
Step 3. Let ; then an optimal schedule is .
Theorem 8. For problem , the schedule generated by Algorithm A is optimal.
Proof. For any feasible solution , let , where is the th element of obtained by Step 1 of Algorithm A. We have This completes the proof.
Algorithm A requires , and the computation of an SPT schedule needs , so the computation of needs .
From (6), we have , where the first term is only dependent on job , while the second term is the total flow-time of all the jobs on machine and is minimized by the SPT rule (Lemma 3). Therefore, an optimal schedule can be constructed for the problem by Algorithm A.
Theorem 9. For problem , the schedule generated by Algorithm A is an optimal one.
Proof. The proof is similar to that of Theorem 8 and is omitted.
In order to overcome the lack of stability in Biskups model in a manufacturing setting, we focus on flowshop scheduling problems with position-dependent exponential learning effect to minimize the makespan and the total flow time. For the two-machine case, we show that Johnson’s algorithm does not obtain optimal result. We thus develop the worst-case ratios of the STPT algorithm to minimize the makespan and the total flow time, respectively, and empirically prove that both bounds are tight by several examples. Finally, for special cases, we show that the problems remain polynomially solvable.
Notice that the complexity of the studied problem remains unreciprocated and the worst-case ratios we developed heavily depend on the number of machines. The dependency of machine number in the flowshop is a limitation of our algorithm as it may create notable discrepancy between the optimal solution and that derived by our method. Therefore, our future research includes proving the complexity of the flowshop scheduling problem with position-dependent exponential learning effect and developing generalizable and effective algorithms for diverse problems.
This work was supported partly by Humanities and Social Science Fund of Ministry of Education of China (no. 11YJCZH019), Humanities and Social Science Key Research Base of Major Projects of Guangdong Province Universities (no. 11jdxm63001), Breeding Project of Department of Education of Guangdong Province (no. wym09116), and Higher Education Research Fund Projects of GDUT (no. 2013WT05).
- S. M. Johnson, “Optimal two-and-three-stage production schedules,” Naval Research Logistics, vol. 1, pp. 61–68, 1954.
- D. G. Dannenbring, “An evaluation of flow shop sequencing heuristics,” Management Science, vol. 23, no. 11, pp. 1174–1182, 1977.
- T. Gonzalez and S. Sahni, “Flowshop and jobshop schedules: complexity and approximation,” Operations Research, vol. 26, no. 1, pp. 36–52, 1978.
- C. Smutnicki, “Some results of the worst-case analysis for flow shop scheduling,” European Journal of Operational Research, vol. 109, no. 1, pp. 66–87, 1998.
- O. Cepek, M. Okada, and M. Vlach, “Non-preemptive flowshop scheduling with machine dominance,” European Journal of Operational Research, vol. 139, no. 2, pp. 245–261, 2002.
- T. P. Wright, “Factors affecting the cost of airplanes,” Journal of Aeronautical Science, vol. 3, pp. 122–128, 1937.
- D. Biskup, “Single-machine scheduling with learning considerations,” European Journal of Operational Research, vol. 115, no. 1, pp. 173–178, 1999.
- T. C. E. Cheng and G. Wang, “Single machine scheduling with learning effect considerations,” Annals of Operations Research, vol. 98, no. 1–4, pp. 273–290, 2000.
- G. Mosheiov, “Scheduling problems with a learning effect,” European Journal of Operational Research, vol. 132, no. 3, pp. 687–693, 2001.
- 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.
- 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.
- 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.
- J.-B. Wang, “Flow shop scheduling jobs with position-dependent processing times,” Journal of Applied Mathematics and Computing, vol. 18, no. 1-2, pp. 383–391, 2005.
- 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.
- Z. Y. Xu, L. Y. Sun, and J. T. Gong, “Worst-case analysis for flow shop scheduling with a learning effect,” International Journal of Production Economics, vol. 113, no. 2, pp. 748–753, 2008.
- 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.
- A. Janiak and R. Rudek, “A new approach to the learning effect: Beyond the learning curve restrictions,” Computers & Operations Research, vol. 35, no. 11, pp. 3727–3736, 2008.
- S.-J. Yang and D.-L. Yang, “Minimizing the makespan on single-machine scheduling with aging effect and variable maintenance activities,” Omega, vol. 38, no. 6, pp. 528–533, 2010.
- D.-C. Li and P.-H. Hsu, “Solving a two-agent single-machine scheduling problem considering learning effect,” Computers & Operations Research, vol. 39, no. 7, pp. 1644–1651, 2012.
- W. C. Lee, M. C. Chuang, and W. C. Yeh, “Uniform parallel-machine scheduling to minimize makespan with position-based learning curves,” Computers & Industrial Engineering, vol. 63, pp. 813–818, 2012.
- Z. Y. Jiang, F. F. Chen, and H. Y. Kang, “Single-machine scheduling problems with actual time-dependent and job-dependent learning effect,” European Journal of Operational Research, vol. 227, no. 1, pp. 76–80, 2013.
- C. C. Wu, Y. Yin, and S. R. Cheng, “Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions,” Journal of the Operational Research Society, vol. 64, pp. 147–156, 2013.
- 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.
- G. Mosheiov, “Minimizing total absolute deviation of job completion times: extensions to position-dependent processing times and parallel identical machines,” Journal of the Operational Research Society, vol. 59, no. 10, pp. 1422–1424, 2008.
- A. Janiak, W. A. Janiak, R. Rudek, and A. Wielgus, “Solution algorithms for the makespan minimization problem with the general learning model,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1301–1308, 2009.
- W.-C. Lee and C.-C. Wu, “Some single-machine and m-machine flowshop scheduling problems with learning considerations,” Information Sciences, vol. 179, no. 22, pp. 3885–3892, 2009.
- X. Huang, J.-B. Wang, L.-Y. Wang, W.-J. Gao, and X.-R. Wang, “Single machine scheduling with time-dependent deterioration and exponential learning effect,” Computers & Industrial Engineering, vol. 58, no. 1, pp. 58–63, 2010.
- X. G. Zhang and G. L. Yan, “Machine scheduling problems with a general learning effect,” Mathematical and Computer Modelling, vol. 51, no. 1-2, pp. 84–90, 2010.
- C. Koulamas, “A note on single-machine scheduling with job-dependent learning effects,” European Journal of Operational Research, vol. 207, no. 2, pp. 1142–1143, 2010.
- J.-B. Wang and J.-J. Wang, “Single-machine scheduling jobs with exponential learning functions,” Computers & Industrial Engineering, vol. 60, no. 4, pp. 755–759, 2011.
- W.-H. Kuo, “Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect,” Annals of Operations Research, vol. 196, pp. 349–359, 2012.
- R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.
- M. R. Garey and D. S. Johnson, Computers and Intractability: A Guided Tour to the Theory of NP-Completeness, W. H. Freeman, San Francisco, Calif, USA, 1979.
- M. L. Pinedo, Scheduling: Theory, Algorithms and Systems, Prentice Hall, Englewood Cliffs, NJ, USA, 2008.
- J. C. Ho and J. N. D. Gupta, “Flowshop scheduling with dominant machines,” Computers & Operations Research, vol. 22, no. 2, pp. 237–246, 1995.
- A. van den Nouweland, M. Krabbenborg, and J. Potters, “Flow-shops with a dominant machine,” European Journal of Operational Research, vol. 62, no. 1, pp. 38–46, 1992.