The Scientific World Journal

Volume 2014, Article ID 242107, 7 pages

http://dx.doi.org/10.1155/2014/242107

## Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

Faculty of Management and Economics, Dalian University of Technology, Dalian 116024, China

Received 21 March 2014; Accepted 30 April 2014; Published 26 May 2014

Academic Editor: Chin-Chia Wu

Copyright © 2014 Guang-Qian Zhang 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.

#### Abstract

*m* unrelated parallel machines scheduling problems with variable job processing times are considered, where the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to determine the optimal resource allocation and the optimal schedule to minimize a total cost function that dependents on the total completion (waiting) time, the total machine load, the total absolute differences in completion (waiting) times on all machines, and total resource cost. If the number of machines is a given constant number, we propose a polynomial time algorithm to solve the problem.

#### 1. Introduction

In classical scheduling theory, it is assumed that the job processing times are fixed and constant values. In practice, however, we often encounter settings in which job processing times may be subject to change due to the deterioration effects and/or learning effects and/or controllable processing times. Extensive surveys of different scheduling models and problems involving deteriorating jobs can be found in Alidaee and Womer [1], Cheng et al. [2], and Gawiejnowicz [3]. A recent survey of the scheduling problems with learning effects could be found in Biskup [4]. A recent survey of the scheduling problems with controllable processing times was given by Shabtay and Steiner [5]. More recent papers that have considered scheduling problems with deterioration effects and/or learning effects and/or controllable processing times include Bai et al. [6, 7], Cheng et al. [8], Gorczyca and Janiak [9], Hsu and Yang [10], Huang and Wang [11], Lee et al. [12], Leyvand et al. [13], Nian and Mao [14], Shabtay and Steiner [15], Wang et al. [16], J. B. Wang and M. Z. Wang [17], J. B. Wang and J. J. Wang [18], Wang et al. [19–21], Wei et al. [22], Wu and Lee [23], Wu and Liu [24], Yang and Kuo [25], S. J. Yang and D. L. Yang [26], Yang et al. [27], Yin et al. [28–31], and Zhao and Tang [32]. Mosheiov and Sidney [33] considered the single machine model: where is the original (normal) processing time of job , is the actual processing time of job , is the position of job when scheduled on the machine, and is the job-dependent learning index of job . Yang and Kuo [25] considered single machine scheduling with the deterioration and learning effect in which the job processing times are where is the starting time of job , is a learning index, and is a common deterioration rate for all the jobs. Shabtay and Steiner [15] considered single machine scheduling with the resource allocation model in which the job processing times are where is the amount of a nonrenewable resource allocated to job , with , where denote the maximum amount of resource allocated to job and is the positive compression rate of job .

Wang et al. [19] considered single machine scheduling problem where the job processing time is a function of position in a sequence, starting time, and resource allocation to this job on a single machine; that is, the model where . For minimizing a cost function containing makespan, total completion (waiting) time, total absolute differences in completion (waiting) times, and total resource cost, they proved that the problem can be solved in polynomial time.

Wang et al. [19] considered single machine scheduling problem with effect of deterioration, learning, and resource allocation simultaneously. The example of the phenomena of deterioration, learning effect, and resource allocation occurring simultaneously can be found in Wang et al. [19]. However, the parallel machine scheduling is interesting and closer to real problems in practice (Cheng et al. [8], Hsu and Yang [10], Huang and Wang [11], Yang et al. [27], and Yin et al. [30]). This paper extends the single machine scheduling results of Wang et al. [19], by considering unrelated parallel machine scheduling problems that include the one given in Wang et al. [19] as a special case. The remainder of this paper is organized as follows. In Section 2 we formulate the model. In Sections 3 and 4, we show that the problem can be solved in polynomial time for two different cost functions. The last section contains some conclusions.

#### 2. Problem Formulation

The model is described as follows. There are independent jobs to be processed on unrelated parallel machines . Each of them is available at time 0. The machine can handle one job at a time, and preemption is not allowed. Let denote the number of jobs assigned to and denote a job-allocation vector, where . We assume, as in most practical situations, that and are a given constant. Each job can be processed on any one of the unrelated parallel machines. Associated with each job on machine , there is a normal processing time . Let denote the actual processing time for job on machine . In this paper, we consider a general unrelated parallel machines model stemming from Yang and Kuo [25], Shabtay and Steiner [15], and Wang et al. [19]; that is, where is the position of job when scheduled on machine , is the starting time of job on machine , is a job-dependent learning index, is a common deterioration rate for all the jobs, is the positive compression rate of job on machine , and is the amount of resource that can be allocated to job on machine , with , where is the upper bound on the amount of resource that can be allocated to job on machine .

Let denote the th job on machine and () denote the completion (waiting) time of job ; , , , , , and are defined similarly, where . Let , (), and () be the load, the total completion (waiting) times, and the total absolute differences in completion (waiting) times of machine . Then, the total machine load, the total completion (waiting) time, and the total absolute deviation of job completion (waiting) time on all machines are , (), and (), respectively. The objective is to determine the optimal resource allocations and the optimal schedule on the machines so that the corresponding value of the following cost functions is optimal: where weights , , , and are given constants and is the per time unit cost associated with the resource allocation. Using the three-field notation introduced by Graham et al. [34], the corresponding scheduling problem is denoted by and .

#### 3. Problem = + − + + +

If the number of jobs on machine is known in advance, from Wang et al. [19], we have

From Kanet [35], we have ; in addition, , , and ; hence, we have where and

From (9), for any given sequence on all machines, the optimal resource allocation on all machines can be obtained by the following.

Lemma 1. *For a given sequence, the optimal resource allocation of the problem can be determined by
**
where , represents the optimal resource allocation of the job in position on machine .*

*Proof. *For the problem , taking the derivative by to (9), we have for . Hence, if , we should not allocate any resource to job ; if , we will allocate the maximal feasible amount of resource to job ; and if , any feasible resource allocation can be optimal.

We define if job is scheduled in position on machine , and otherwise. If the number of jobs on machine is known in advance, then we formulate the problem as the following assignment problem: subject to where Constraint (13) makes sure that each job is scheduled exactly once. Constraint (14) makes sure that each position on each machine is taken by one job.

Next, the question is how many vectors exist. Note that may be for . So, if we get the numbers of jobs on the first machines, the number of jobs processed on the last machine is then determined uniquely due to . Therefore, the upper bound of the number of vectors is . Based on the above analysis, we have the following result.

Theorem 2. *The problem can be solved in time; that is, the problem is polynomially solvable because is a constant.*

Base on the above analysis, we can determine the optimal solution for the problem via the following algorithm.

*Algorithm 3. *
Consider the following. *Step 1*. For all the possible vectors , solve the assignment problems ((12)–(16)). Then, obtain the optimal schedule and the corresponding total cost for each possible vector .*Step 2*. The optimal solution for the problem is the one with the minimum value of the total cost .*Step 3*. Calculate the optimal resources allocation by using (11).

The following example illustrates the working of Algorithm 3 for the problem .

*Example 4. **Data.*, , , and , and the other corresponding parameters are shown in Table 1.

*Solution*. When , , then the optimal schedule on machine is and .

When , , the optimal schedule on machine is and on machine is , and .

When , the optimal schedule on machine is and on machine is , and .

When , , the optimal schedule on machine is and on machine is , and .

When , , the optimal schedule on machine is , and .

Hence, the optimal schedule on machine is and on machine is , and optimal cost is .

#### 4. Problem = + − + + +

Similar to the analysis of the problem presented in the previous section, if we substitute , , and = (Bagchi [36]) into (7), we have where ,

Applying a similar analysis in the previous section, we have the following results.

Lemma 5. *For a given sequence, the optimal resource allocation of the problem can be determined by
**
where represents the optimal resource allocation of the job in position on machine .*

Lemma 6. *For the problem , if the vector is given, the optimal sequence can be determined by solving the following assignment problem:
**
where
*

Theorem 7. *The problem can be solved in time; that is, the problem is polynomially solvable because is a constant.*

The optimal solution for the problem can be obtained by the following algorithm.

*Algorithm 8. *
Consider the following. *Step 1*. For all the possible vectors , solve the assignment problems ((20), (13)–(15), (21)). Then, obtain the optimal schedule and the corresponding total cost for each possible vector . *Step 2*. The optimal solution for the problem is the one with the minimum value of the total cost . *Step 3*. Calculate the optimal resources allocation by using (19).

The following example illustrates the working of Algorithm 8 for the problem .

*Example 9. *The same date in Example 4 is used.

*Solution*. When , , then the optimal schedule on machine is and .

When , , the optimal schedule on machine is and on machine is , and .

When , , the optimal schedule on machine is and on machine is , and .

When , , the optimal schedule on machine is and on machine is , and .

When , , the optimal schedule on machine is , and .

Hence, the optimal schedule on machine is and on machine is , and optimal cost is .

#### 5. Conclusions

In this paper, we have studied the problem of scheduling jobs on unrelated parallel machines with simultaneous consideration of learning effect, deteriorating jobs, and controllable processing times. We provide an time algorithm for the problems and , respectively. The algorithms can also be easily applied to the cases (aging effect) and . Future research may focus on similar problems with more general processing time model and extend the problems to flow shop machine settings.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

The authors are grateful for three anonymous referees for their helpful comments on earlier version of the paper. This research was supported by the National Natural Science Foundation of China (Grant nos. 11001181 and 71271039), the New Century Excellent Talents in University (NCET-13-0082), the Changjiang Scholars and Innovative Research Team in University (IRT1214), and the Fundamental Research Funds for the Central Universities (DUT14YQ211).

#### References

- B. Alidaee and N. K. Womer, “Scheduling with time dependent processing times: review and extensions,”
*Journal of the Operational Research Society*, vol. 50, no. 7, pp. 711–720, 1999. View at Google Scholar · View at Scopus - T. C. E. Cheng, Q. Ding, and B. M. T. Lin, “A concise survey of scheduling with time-dependent processing times,”
*European Journal of Operational Research*, vol. 152, no. 1, pp. 1–13, 2004. View at Publisher · View at Google Scholar · View at Scopus - S. Gawiejnowicz,
*Time-Dependent Scheduling*, Springer, Berlin, Germany, 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. View at Publisher · View at Google Scholar · View at Scopus - D. Shabtay and G. Steiner, “A survey of scheduling with controllable processing times,”
*Discrete Applied Mathematics*, vol. 155, no. 13, pp. 1643–1666, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. Bai, Z.-R. Li, and X. Huang, “Single-machine group scheduling with general deterioration and learning effects,”
*Applied Mathematical Modelling*, vol. 36, no. 3, pp. 1267–1274, 2012. View at Publisher · View at Google Scholar · View at Scopus - J. Bai, M.-Z. Wang, and J.-B. Wang, “Single machine scheduling with a general exponential learning effect,”
*Applied Mathematical Modelling*, vol. 36, no. 2, pp. 829–835, 2012. View at Publisher · View at Google Scholar · View at Scopus - T. C. E. Cheng, C.-J. Hsu, and D.-L. Yang, “Unrelated parallel-machine scheduling with deteriorating maintenance activities,”
*Computers and Industrial Engineering*, vol. 60, no. 4, pp. 602–605, 2011. View at Publisher · View at Google Scholar · View at Scopus - M. Gorczyca and A. Janiak, “Resource level minimization in the discrete-continuous scheduling,”
*European Journal of Operational Research*, vol. 203, no. 1, pp. 32–41, 2010. View at Publisher · View at Google Scholar · View at Scopus - C.-J. Hsu and D.-L. Yang, “Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time,”
*Optimization Letters*, vol. 8, pp. 519–531, 2014. View at Publisher · View at Google Scholar - X. Huang and M.-Z. Wang, “Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties,”
*Applied Mathematical Modelling*, vol. 35, no. 3, pp. 1349–1353, 2011. View at Publisher · View at Google Scholar · View at Scopus - W.-C. Lee, C.-C. Wu, Y.-H. Chung, and H.-C. Liu, “Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates,”
*Computers and Operations Research*, vol. 36, no. 6, pp. 2111–2121, 2009. View at Publisher · View at Google Scholar · View at Scopus - Y. Leyvand, D. Shabtay, and G. Steiner, “A unified approach for scheduling with convex resource consumption functions using positional penalties,”
*European Journal of Operational Research*, vol. 206, no. 2, pp. 301–312, 2010. View at Publisher · View at Google Scholar · View at Scopus - H. Nian and Z. Mao, “Single-machine scheduling with job rejection, deteriorating effects, and deteriorating maintenance activities,”
*Mathematical Problems in Engineering*, vol. 2013, Article ID 389120, 9 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet - D. Shabtay and G. Steiner, “The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times,”
*Annals of Operations Research*, vol. 159, no. 1, pp. 25–40, 2008. View at Publisher · View at Google Scholar · View at Scopus - J.-B. Wang, L. Liu, and C. Wang, “Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs,”
*Applied Mathematical Modelling*, vol. 37, pp. 8394–8400, 2013. View at Publisher · View at Google Scholar - J.-B. Wang and M.-Z. Wang, “Worst-case analysis for flow shop scheduling problems with an exponential learning effect,”
*Journal of the Operational Research Society*, vol. 63, no. 1, pp. 130–137, 2012. View at Publisher · View at Google Scholar · View at Scopus - J.-B. Wang and J.-J. Wang, “Flowshop scheduling with a general exponential learning effect,”
*Computers & Operations Research*, vol. 43, pp. 292–308, 2014. View at Google Scholar - J.-B. Wang, M.-Z. Wang, and P. Ji, “Scheduling jobs with processing times dependent on position, starting time and allotted resource,”
*Asia-Pacific Journal of Operational Research*, vol. 29, Article ID 1250030, 2012. View at Publisher · View at Google Scholar - J.-B. Wang, X.-Y. Wang, L.-H. Sun, and L.-Y. Sun, “Scheduling jobs with truncated exponential learning functions,”
*Optimization Letters*, vol. 7, no. 8, pp. 1857–1873, 2011. View at Publisher · View at Google Scholar · View at Scopus - D. Wang, M.-Z. Wang, and J.-B. Wang, “Single-machine scheduling with learning effect and resource-dependent processing times,”
*Computers and Industrial Engineering*, vol. 59, no. 3, pp. 458–462, 2010. View at Publisher · View at Google Scholar · View at Scopus - C.-M. Wei, J.-B. Wang, and P. Ji, “Single-machine scheduling with time-and-resource-dependent processing times,”
*Applied Mathematical Modelling*, vol. 36, no. 2, pp. 792–798, 2012. View at Publisher · View at Google Scholar · View at Scopus - C.-C. Wu and W.-C. Lee, “Single-machine and flowshop scheduling with a general learning effect model,”
*Computers and Industrial Engineering*, vol. 56, no. 4, pp. 1553–1558, 2009. View at Publisher · View at Google Scholar · View at Scopus - C.-C. Wu and C.-L. Liu, “Minimizing the makespan on a single machine with learning and unequal release times,”
*Computers and Industrial Engineering*, vol. 59, no. 3, pp. 419–424, 2010. View at Publisher · View at Google Scholar · View at Scopus - D.-L. Yang and W.-H. Kuo, “Some scheduling problems with deteriorating jobs and learning effects,”
*Computers and Industrial Engineering*, vol. 58, no. 1, pp. 25–28, 2010. View at Publisher · View at Google Scholar · View at Scopus - S.-J. Yang and D.-L. Yang, “Single-machine group scheduling problems under the effects of deterioration and learning,”
*Computers and Industrial Engineering*, vol. 58, no. 4, pp. 754–758, 2010. View at Publisher · View at Google Scholar · View at Scopus - D. L. Yang, T. C. E. Cheng, and S. J. Yang, “Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions,”
*International Journal of Production Research*, vol. 52, no. 4, pp. 1133–1141, 2014. View at Publisher · View at Google Scholar - Y. Yin, T. C. E. Cheng, C. C. Wu, and S. R. Cheng, “Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times,”
*International Journal of Production Research*, vol. 51, pp. 5083–5099, 2013. View at Publisher · View at Google Scholar - Y. Yin, T. C. E. Cheng, C. C. Wu, and S. R. Cheng, “Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time,”
*Journal of the Operational Research Society*, vol. 65, pp. 1–13, 2014. View at Google Scholar - N. Yin, L. Kang, T. C. Sun, C. Yue, and X. R. Wang, “Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times,”
*Applied Mathematical Modelling*, 2014. View at Publisher · View at Google Scholar - N. Yin, L. Kang, and X. Y. Wang, “Single-machine group scheduling with processing times dependent on position, starting time and allotted resource,”
*Applied Mathematical Modelling*, 2014. View at Publisher · View at Google Scholar - C. L. Zhao and H. Y. Tang, “Single machine scheduling problems with general positiondependent processing times and past-sequence-dependent delivery times,”
*Journal of Applied Mathematics and Computing*, vol. 45, no. 1-2, pp. 259–274, 2014. View at Publisher · View at 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 · View at Google Scholar · View at Scopus - 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. View at Publisher · View at Google Scholar · View at Scopus - J. J. Kanet, “Minimizing variation of flow time in single machine systems,”
*Management Science*, vol. 27, no. 12, pp. 1453–1464, 1981. View at Google Scholar · View at Scopus - U. Bagchi, “Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems,”
*Operations Research*, vol. 37, no. 1, pp. 118–125, 1989. View at Google Scholar · View at Scopus