61
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Two-Agent Scheduling with Cumulative Deteriorating Jobs on a Single Machine

&

References

  • Alidaee, B., & Womer, N.K. (1999). Scheduling with time dependent processing times: Review and extensions. Journal of the Operational Research Society, 50(7), 711–720.
  • Agnetis, A., Mirchandani, P.B., Pacciarelli, D., & Pacifici, A. (2004). Scheduling problems with two competing agents. Operations Research, 52(2), 229–242.
  • Agnetis, A., Pacciarelli, D., & Pacifici, A. (2007). Multi-agent single machine scheduling. Annals of Operations Research, 150(1), 3–15.
  • Baker, K.R., & Smith, J.C. (2003). A multiple-criterion model for machine scheduling. Journal of Scheduling, 6(1), 7–16.
  • Cormen, T.H., Leiserson, C.E., Rivest, R.L., & Stein, C. (2001). Introduction to algorithms. Cambridge, MA: MIT Press.
  • Cheng, T.C. E, Ding, Q., & Lin, B.M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1–13.
  • Cheng, T.C. E, Ng, C.T., & Yuan, J.J. (2006). Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs. Theoretical Computer Science, 362(1), 273–281.
  • Cheng, T.C. E., Ng, C.T., & Yuan, J.J. (2008). Multi-agent scheduling on a single machine with max-form criteria. European Journal of Operational Research, 188(2), 603–609.
  • Cheng, T.C. E., Wu, W.H., Cheng, S.R., & Wu, C.C. (2011). Two-agent scheduling with position-based deteriorating jobs and learning effects. Applied Mathematics and Computation, 217(21), 8804–8824.
  • Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer-Verlag.
  • Graham, R.L., Lawler, E.L., Lenstra, J.K., & Rinnooy Kan, A.H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287–326.
  • Kellerer, H., Rustogi, K., & Strusevich, V.A. (2013). Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance. Journal of Scheduling, 16(6): 675–683.
  • Lee, W.C., Wang, W.J., Shiau, Y.R., & Wu, C.C. (2010). A single-machine scheduling problem with two-agents and deteriorating jobs. Applied Mathematical Modelling, 34(10), 3098–3107.
  • Lee, W.C., Wu, C.C, & Liu, H.C. (2009). A note on single-machine makespan problem with general deteriorating function. The International Journal of Advanced Manufacturing Technology, 40(9–10), 1053–1056.
  • Leung, J.Y. T., Pinedo, M., & Wan G. (2010). Competitive two-agent scheduling and its applications. Operations Research, 58(2), 458–469.
  • Liu, P., & Tang, L. (2008). Two-agent scheduling with linear deteriorating jobs on a single machine. In Computing and Combinatorics, Lecture Notes in Computer Science, 5092, 642–650.
  • Liu, P., Tang, L., & Zhou, X. (2010). Two-agent group scheduling with deteriorating jobs on a single machine. The International Journal of Advanced Manufacturing Technology, 47(5–8), 657–664.
  • Liu, P., Yi, N., & Zhou, X. (2011). Two-agent single-machine scheduling problems under increasing linear deterioration. Applied Mathematical Modelling, 35(5), 2290–2296.
  • Liu, P., Zhou, X., & Tang, L. (2010). Two-agent single-machine scheduling with position-dependent processing times. The International Journal of Advanced Manufacturing Technology, 48(1–4), 325–331.
  • Mor, B., & Mosheiov, G. (2010). Scheduling problems with two competing agents to minimize minmax and minsum earliness measures. European Journal of Operational Research, 206(3), 540–546.
  • Mosheiov, G. (1994). Scheduling jobs under simple linear deterioration. Computers & Operations Research, 21(6), 653–659.
  • Tang, L., Luh, P.B., Liu, J., & Fang, L. (2002). Steel-making process scheduling using Lagrangian relaxation, International Journal of Production Research, 40(1), 55–70.
  • Wu, C.C., Lee, W.C., & Shiau, Y.R. (2007). Minimizing the total weighted completion time on a single machine under linear deterioration. The International Journal of Advanced Manufacturing Technology, 33(11–12), 1237–1243.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.