Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2017, Article ID 7150637, 7 pages
https://doi.org/10.1155/2017/7150637
Research Article

Maximum Lateness Scheduling on Two-Person Cooperative Games with Variable Processing Times and Common Due Date

School of Management, Shenyang University of Technology, Shenyang 110870, China

Correspondence should be addressed to Peng Liu; moc.361@2087puil

Received 22 December 2016; Accepted 28 March 2017; Published 6 April 2017

Academic Editor: Manlio Gaudioso

Copyright © 2017 Peng Liu and Xiaoli Wang. 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.

Linked References

  1. J. Jin, Y. H. Gu, and G. C. Tang, “Two-person cooperative games on makespan scheduling,” Journal of Shanghai Second Polytechnic University, vol. 28, no. 1, pp. 14–17, 2011. View at Google Scholar
  2. W. Q. Dou, Y. H. Gu, and G. C. Tang, “The Nash bargaining solution of two-person cooperative games on total completion time scheduling,” Journal of Chongqing Normal University (Natural Science), vol. 29, no. 5, pp. 1–5, 2012. View at Google Scholar
  3. Y. H. Gu, J. Jin, and G. C. Tang, “Nash bargaining on maximum flow time scheduling with changeable processing time,” Journal of Chongqing Normal University (Natural Science), vol. 29, no. 4, pp. 18–23, 2012. View at Google Scholar
  4. J. Jin, “Two-person cooperative game problem on scheduling with linear processing time of its starting time,” Journal of Nanjing Normal University (Engineering and Technology Edition), vol. 12, no. 4, pp. 87–92, 2012. View at Google Scholar
  5. J. Jin, “Two-person cooperative games on total completion time scheduling with changeable processing time,” Journal of Suzhou Vocational University, vol. 24, no. 3, pp. 35–39, 2013. View at Google Scholar
  6. Y. Gu, J. Fan, G. Tang, and J. Zhong, “Maximum latency scheduling problem on two-person cooperative games,” Journal of Combinatorial Optimization, vol. 26, no. 1, pp. 71–81, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. L. L. Liu, G. C. Tang, B. Q. Fan, and X. P. Wang, “Two-person cooperative games on scheduling problems in outpatient pharmacy dispensing process,” Journal of Combinatorial Optimization, vol. 30, no. 4, pp. 938–948, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. Q. L. Chen, A new discrete bargaining model on job partition between two manufacturers [Ph.D. thesis], The Chinese University of Hong Kong, 2006.
  9. G. C. Tang, B. Q. Fan, and L. L. Liu, “Classifications, advances and prospects of scheduling games,” Journal of Chongqing Normal University (Natural Science), vol. 31, no. 1, pp. 6–14, 2014. View at Google Scholar
  10. S. A. Gawiejnowicz, “A note on scheduling on a single processor with speed dependent on a number of executed jobs,” Information Processing Letters, vol. 57, no. 6, pp. 297–300, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. D. Biskup, “Single-machine scheduling with learning considerations,” European Journal of Operational Research, vol. 115, no. 1, pp. 173–178, 1999. View at Publisher · View at Google Scholar · View at Scopus
  12. T. C. Cheng and G. Wang, “Single machine scheduling with learning effect considerations,” Annals of Operations Research, vol. 98, pp. 273–290, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. G. Mosheiov, “Parallel machine scheduling with a learning effect,” Journal of the Operational Research Society, vol. 52, pp. 1165–1169, 2001. View at Google Scholar
  14. A. Bachman and A. Janiak, “Scheduling jobs with position-dependent processing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 257–264, 2004. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Liu, X. Zhou, and L. Tang, “Two-agent single-machine scheduling with position-dependent processing times,” International Journal of Advanced Manufacturing Technology, vol. 48, no. 1–4, pp. 325–331, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. R. A. Rudek, “Scheduling problems with position dependent job processing times: computational complexity results,” Annals of Operations Research, vol. 196, pp. 491–516, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. 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 Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. Y. Zhou and Q. Zhang, “Multiple-machine scheduling with learning effects and cooperative games,” Mathematical Problems in Engineering, vol. 2015, Article ID 197123, 7 pages, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. X. G. Zhang, Y. Wang, and S. K. Bai, “Single-machine group scheduling problems with deteriorating and learning effect,” International Journal of Systems Science, vol. 47, no. 10, pp. 2402–2410, 2016. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. A. Janiak and R. Rudek, “Scheduling jobs under an aging effect,” Journal of the Operational Research Society, vol. 61, no. 6, pp. 1041–1048, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  21. S.-J. Yang, C.-J. Hsu, and D.-L. Yang, “Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance,” Optimization Letters, vol. 6, no. 8, pp. 1855–1873, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. R. Rudek, “Minimising maximum lateness in a single machine scheduling problem with processing time-based aging effects,” European Journal of Industrial Engineering, vol. 7, no. 2, pp. 206–223, 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. P. Ji, G. Li, Y. Huo, and J.-B. Wang, “Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity,” Optimization Letters, vol. 8, no. 4, pp. 1389–1400, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  24. J. Y. Choi, “Minimizing total weighted completion time under makespan constraint for two-agent scheduling with job-dependent aging effects,” Computers and Industrial Engineering, vol. 83, pp. 237–243, 2015. View at Publisher · View at Google Scholar · View at Scopus
  25. X. Zeng, Z. He, H. Yu, and S. Qu, “Bidirectional nonnegative deep model and its optimization in learning,” Journal of Optimization, vol. 2016, Article ID 5975120, 8 pages, 2016. View at Publisher · View at Google Scholar · View at MathSciNet