JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Simulated Annealing for Two-Agent Scheduling Problem with Exponential Job-Dependent Position-Based Learning Effects
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Simulated Annealing for Two-Agent Scheduling Problem with Exponential Job-Dependent Position-Based Learning Effects
Choi, Jin Young;
  PDF(new window)
 Abstract
In this paper, we consider a two-agent single-machine scheduling problem with exponential job-dependent position-based learning effects. The objective is to minimize the total weighted completion time of one agent with the restriction that the makespan of the other agent cannot exceed an upper bound. First, we propose a branch-and-bound algorithm by developing some dominance /feasibility properties and a lower bound to find an optimal solution. Second, we design an efficient simulated annealing (SA) algorithm to search a near optimal solution by considering six different SAs to generate initial solutions. We show the performance superiority of the suggested SA using a numerical experiment. Specifically, we verify that there is no significant difference in the performance of %errors between different considered SAs using the paired t-test. Furthermore, we testify that random generation method is better than the others for agent A, whereas the initial solution method for agent B did not affect the performance of %errors.
 Keywords
Two-Agent Scheduling;Exponential Learning Effect;Job-Dependent Position-Based Processing Time;Total Weighted Completion Time;Makespan;Branch-And-Bound Algorithm;Simulated Annealing;
 Language
English
 Cited by
 References
1.
Agnetis, A. (2012), "Multiagent scheduling problems", Tutorials in Operations Research, Informs 2012, pp. 151-170.

2.
Agnetis, A., Mirchandani, P.B., Pacciarelli, D., and Pacifici, A. (2004), "Scheduling problems with two competing agents", Operations Research, 52(2), pp. 229-242. crossref(new window)

3.
Bachman, A. and Janiak, A. (2004), "Scheduling jobs with position-dependent processing times", Journal of the Operational Research Society, 55, pp. 257-264. crossref(new window)

4.
Baker, K.R. and Smith, J.C. (2003), "A multiple-criterion model for machine scheduling", Journal of Scheduling, 6, pp. 7-16. crossref(new window)

5.
Biskup D. (1999), "Single-machine scheduling with learning considerations", European Journal of Operational Research, 115, pp. 173-178. crossref(new window)

6.
Biskup, D. (2008), "A state-of-the-art review on scheduling with learning considerations", European Journal of Operational Research, 188(2), pp. 315-329. crossref(new window)

7.
Chang, P.C., Chen, S.H., and Mani, V. (2009), "A note on due-date assignment and single machine scheduling with a learning/aging effect", International Journal of Production Economics, 117, pp. 142-149. crossref(new window)

8.
Cheng, T.C.E. and Wang, G. (2000), "Single machine scheduling with learning effect considerations", Annals of Operations Research, 98, pp. 273-290. crossref(new window)

9.
Cheng, T.C.E., Wu, W.H., Cheng, S.R., and Wu, C.C. (2011), "Two-agent scheduling with position-based deterioration jobs and learning effects", Applied Mathematics and Computation, 217, pp. 8804-8824. crossref(new window)

10.
Choi, J.Y. (2015), "An efficient simulated annealing for two-agent scheduling with exponential job-dependent position-based learning consideration", In the proceeding of the MISTA 2015 Conference, Prague, Czech Republic.

11.
Graham, R.L., Lawler, E.L., Lenstra, J.K., and Rinnooy, Kan AHG. (1979), "Optimization and approximation in deterministic sequencing and scheduling theory: a survey", Annals of Discrete Mathematics, 5, pp. 287-326. crossref(new window)

12.
Hardy, G., Littlewood, J., and Polya, G., Inequalities. London: Cambridge University Press, 1967.

13.
Hayter, A. J., Probability and Statistics, International Thomson PUB, 1996.

14.
Hillier, F.S. and Lieberman, G.J., Introduction to Operations Research, McGraw Hill, 2015.

15.
Kirkpatrick, S., Gelatt, C., and Vecchi, M. (1983). "Optimization by simulated annealing", Science, 220, pp. 671-680. crossref(new window)

16.
Kuo, W.H. and Yang, D.L. (2008), "Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect", Journal of the Operational Research Society, 59, pp. 416-420. crossref(new window)

17.
Lee, W.C., Wang, W.J, Shiau, Y.R., and Wu, C.C. (2010), "A single-machine scheduling problem with two-agent and deteriorating jobs", Applied Mathematical Modelling, 34, pp. 3098-3107. crossref(new window)

18.
Li, D.C. and Hsu, P.H. (2012), "Solving a two-agent single-machine scheduling problem considering learning effect", Computers & Operations Research, 39, pp. 1644-1651. crossref(new window)

19.
Liu, P., Zhou, X., and Tang, L. (2010), "Two-agent single-machine scheduling with position-dependent processing times", International Journal of Advanced Manufacturing Technology, 48, pp. 325-331. crossref(new window)

20.
Liu, P., Yi, N., and Zhou, X. (2011), "Two-agent single-machine scheduling problems under increasing linear deterioration", Applied Mathematical Modelling, 35, pp. 2290-2296. crossref(new window)

21.
Mosheiov, G. (2001), "Parallel machine scheduling with a learning effect", Journal of the Operational Research Society, 52, pp. 1165-1169. crossref(new window)

22.
Mosheiov, G. (2005), "A note on scheduling deteriorating jobs", Mathematical and Computer Modelling, 41, pp. 883-886. crossref(new window)

23.
Moshiov, G. and Sidney, J. B. (2003), "Scheduling with general job-dependent learning curves", European Journal of Operational Research, 147, pp. 665-670. crossref(new window)

24.
Wang, J.B. and Xia, Z.Q. (2005), "Flow-shop scheduling with a learning effect", Journal of the Operational Research Society, 56, pp. 1325-1330. crossref(new window)

25.
Wu, C.C., Huang, S.K., and Lee, W.C. (2011), "Two-agent scheduling with learning consideration", Computers & Industrial Engineering, 61, pp. 1324-1335. crossref(new window)

26.
Wu, W.H., Xu, J., Wu, W.H., Yin, Y., Cheng, I.F., and Wu, C.C. (2013), "A tabu method for a two-agent single-machine scheduling with deterioration jobs", Computers & Operations Research, 40, pp. 2116-2127. crossref(new window)