|
[1]M.J. Soomer, G.J. Franx, Scheduling aircraft landings using airlines’ preferences, European Journal of Operational Research190(2008) 277–291.
[2]K.R. Baker, J.C. Smith, A multiple-criterion model for machine scheduling, Journal of Scheduling 6 (2003) 7-16.
[3]M.A. Kubzin, V.A. Strusevich, Planning machine maintenance in two-machine shop scheduling, Operations Research 54 (2006) 789-800.
[4]J.Y.T. Leung, M. Pinedo, G.H. Wan, Competitive two agents scheduling and its applications, Operations Research 58 (2010) 458-469.
[5]A. Agnetis, P.B. Mirchandani, D. Pacciarelli, A. Pacifici, Scheduling problems with two competing agents, Operations Research 52 (2004) 229-242.
[6]J.J. Yuan, W.P. Shang, Q. Feng, A note on the scheduling with two families of jobs, Journal of Scheduling 8 (2005) 537–542.
[7]T.C.E. Cheng, C.T. Ng, J.J. Yuan, Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs, Theoretical Computer Science 362 (2006) 273–281.
[8]T.C.E. Cheng, C.T. Ng, J.J. Yuan, Multi-agent scheduling on a single machine with max-form criteria, European Journal of Operational Research 188 (2008) 603–609.
[9]C.T. Ng, T.C.E. Cheng, J.J. Yuan, A note on the complexity of the problem of two-agent scheduling on a single machine, Journal of Combinatorial Optimization 12 (2006) 387–394.
[10]A. Agnetis, D. Pacciarelli, A. Pacifici, Multi-agent single machine scheduling, Annals of Operations Research 150 (2007) 3-15.
[11]A. Agnetis, G. Pascale, D. Pacciarelli, A Lagrangian approach to single-machine scheduling problems with two competing agents, Journal of Scheduling 12 (2009) 401-415.
[12]P. Liu, L. Tang, Two-agent scheduling with linear deteriorating jobs on a single machine, Lecture Notes in Computer Science 5092 (2008) 642–650.
[13]K.B. Lee, B.C. Choi, J.Y.T. Leung, M.L. Pinedo, Approximation algorithms for multi-agent scheduling to minimize total weighted completion time, Information Processing Letters 109 (2009) 913-917.
[14]W.C. Lee, W.J. Wang, Y.R. Shiau, C.C. Wu, A single-machine scheduling problem with two-agent and deteriorating jobs, Applied Mathematical Modelling 34 (2010) 3098-3107.
[15]W.C. Lee, S.K. Chen, C.C. Wu, Branch-and-bound and simulated annealing algorithms for a two-agent scheduling problem, Expert Systems with Applications 37 (2010) 6594-6601.
[16]P. Liu, L. Tang, X. Zhou, Two-agent group scheduling with deteriorating jobs on a single machine, International Journal of Advanced Manufacturing Technology 47 (2010) 657–664.
[17]P. Liu, X. Zhou, L. Tang, Two-agent single-machine scheduling with position- dependent processing times, International Journal of Advanced Manufacturing Technology 48 (2010) 325–331.
[18]B. Mor, G. Mosheiov, Scheduling problems with two competing agents to minimize minmax and minsum earliness measures, European Journal of Operational Research 206 (2010) 540-546.
[19]G. Wan, S.R. Vakati, J.Y.T. Leung, M. Pinedo, Scheduling two agents with controllable processing times, European Journal of Operational Research 205 (2010) 528–539.
[20]P. Liu, N. Yi, X. Zhou, Two-agent single-machine scheduling problems under increasing linear deterioration, Applied Mathematical Modeling 35 (2011) 2290-2296.
[21]W.C. Lee, S.K. Chen, C.W. Chen, C.C. Wu, A two-machine flowshop problem with two agents, Computers and Operations Research 38 (2011) 98-104.
[22]B. Mor, G. Mosheiov, Single machine batch scheduling with two competing agents to minimize total flowtime, European Journal of Operational Research 215 (2011) 524-531.
[23]Q.Q. Nong, T.C.E. Cheng, C.T. Ng, Two agent scheduling to minimize the total cost, European Journal of Operational Research 215 (2011) 39-44.
[24]D. Biskup, A state-of-the-art review on scheduling with learning effect, European Journal of Operational Research 188 (2008) 315-329.
[25]Z. Jiang, F. Chen, C. Wu, Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect, Applied Mathematics and Computation doi:10.1016/j.apm.2011.01.039.
[26]C.J. Hsu, W.H. Kuo, D.L. Yang, Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects, Applied Mathematical Modelling 35 (2011) 1492–1496.
[27]J.B. Wang, J.X. Li, Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects, Applied Mathematical Modelling 35 (2011) 1388–1395.
[28]S.J. Yang, D.L. Yang, Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption, Applied Mathematical Modelling 35 (2011) 2068–2074.
[29]Y.Y. Lu, C.M. Wei, J.B. Wang, Several single-machine scheduling problems with general learning effects, Applied Mathematical Modelling doi:10.1016/j.apm.2012.01.022.
[30]J. Bai, M.Z. Wang, J.B. Wang, Single machine scheduling with a general exponential learning effect, Applied Mathematical Modelling 36 (2012) 829–835.
[31]W.H. Kuo, C.J. Hsu, D.L. Yang, Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects, Computers & Industrial Engineering 61 (2011) 179–183.
[32]Z. Zhu, L. Sun, F. Chu, M. Liu, Single-machine group scheduling with resource allocation and learning effect, Computers & Industrial Engineering 60 (2011) 148–157.
[33]R. Rudek, Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect, Computers & Industrial Engineering 61 (2011) 20–31.
[34]J.B. Wang, J.J. Wang, Single-machine scheduling jobs with exponential learning functions, Computers & Industrial Engineering 60 (2011) 755–759.
[35]Y.H. Chung, L.I. Tong, Bi-criteria minimization for the permutation flowshop scheduling problem with machine-based learning effects, Computers & Industrial Engineering doi: 10.1016/j.cie.2012.03.009.
[36]J.B. Wang, L.H. Sun, L.Y. Sun, Scheduling jobs with an exponential sum-of-actual-processing-time-based learning effect, Computers and Mathematics with Applications 60 (2010) 2673–2678.
[37]J.B. Wang, M.Z. Wang, Single machine multiple common due dates scheduling with learning effects, Computers and Mathematics with Applications 60 (2010) 2998–3002.
[38]S.J. Yang, D.L. Yang, Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities, Computers and Mathematics with Applications 60 (2010) 2161-2169.
[39]Y. Yin, D. Xu, Some single-machine scheduling problems with general effects of learning and deterioration, Computers and Mathematics with Applications 61 (2011) 100–108.
[40]W.C. Lee, A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time, Computers and Mathematics with Applications 62 (2011) 2095–2100.
[41]X. Zhang, G. Yan, W. Huang, G. Tang, A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects, Information Sciences 187 (2012) 298–304.
[42]W.H. Kuo, C.J. Hsu, D.L. Yang, Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect, Information Sciences 184 (2012) 282–297.
[43]R. Rudek, The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model, Information Sciences doi:10.1016/j.ins.2012.02.043.
[44]P.J. Lai, W.C. Lee, Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects, Omega 39 (2011) 467–471.
[45]W.J. Hurley, When are we going to change the learning curve lecture?, Computers & Operations Research 23 (1996) 509–511
[46]D. Biskup, Single-machine scheduling with learning considerations, European Journal of Operational Research 115 (1999) 173–178.
[47]W.C. Lee, Scheduling with general position-based learning curves, Information Sciences 181 (2011) 5515–5522.
[48]E.G. Lopez and M. O’Neill, On the effects of locality in a permutation problem: the Sudoku puzzle, IEEE Symposium on Computational Intelligence and Games (2009) 80-87.
[49]J. Du and J.Y.T. Leung, Minimizing total tardiness on one machine is NP-hard, Mathematics of Operation Research 15 (1990) 483-495.
|