Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 596306, 9 pages
http://dx.doi.org/10.1155/2014/596306
Research Article

Single-Machine Scheduling to Minimize Total Completion Time and Tardiness with Two Competing Agents

1Department of Statistics, Feng Chia University, Taichung, Taiwan
2Department of Industrial Engineering and System Management, Feng Chia University, Taichung, Taiwan
3Department of Industrial & Engineering Management, National Chiao Tung University, Hsinchu, Taiwan

Received 25 November 2013; Accepted 12 December 2013; Published 19 January 2014

Academic Editors: F. R. B. Cruz and A. Sedeño-noda

Copyright © 2014 Wen-Chiung Lee 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.

Linked References

  1. M. Pinedo, Scheduling: Theory, Algorithms and Systems, Springer, New York, NY, USA, 3rd edition, 2008.
  2. R. Rudek, “Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect,” Computers and Industrial Engineering, vol. 61, no. 1, pp. 20–31, 2011. View at Publisher · View at Google Scholar · View at Scopus
  3. J. B. Wang and J. J. Wang, “Single machine scheduling with sum-of-logarithm-processing-time based and position based learning effects,” Optimization Letters, 2012. View at Publisher · View at Google Scholar
  4. S. J. Yang, “Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time,” Applied Mathematical Modelling, vol. 37, pp. 2995–3005, 2012. View at Google Scholar
  5. J. M. Peha, “Heterogeneous-criteria scheduling: minimizing weighted number of tardy jobs and weighted completion time,” Computers and Operations Research, vol. 22, no. 10, pp. 1089–1100, 1995. View at Google Scholar · View at Scopus
  6. P. J. Brewer and C. R. Plott, “A binary conflict ascending price (BICAP) mechanism for the decentralized allocation of the right to use railroad tracks,” International Journal of Industrial Organization, vol. 14, no. 6, pp. 857–886, 1996. View at Publisher · View at Google Scholar · View at Scopus
  7. M. A. Kubzin and V. A. Strusevich, “Planning machine maintenance in two-machine shop scheduling,” Operations Research, vol. 54, no. 4, pp. 789–800, 2006. View at Publisher · View at Google Scholar · View at Scopus
  8. K. R. Baker and J. C. Smith, “A multiple-criterion model for machine scheduling,” Journal of Scheduling, vol. 6, no. 1, pp. 7–16, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Agnetis, P. B. Mirchandani, D. Pacciarelli, and A. Pacifici, “Scheduling problems with two competing agents,” Operations Research, vol. 52, no. 2, pp. 229–242, 2004. View at Publisher · View at Google Scholar · View at Scopus
  10. T. C. E. Cheng, C. T. Ng, and J. J. Yuan, “Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs,” Theoretical Computer Science, vol. 362, no. 1–3, pp. 273–281, 2006. View at Publisher · View at Google Scholar · View at Scopus
  11. C. T. Ng, T. C. E. Cheng, and J. J. Yuan, “A note on the complexity of the problem of two-agent scheduling on a single machine,” Journal of Combinatorial Optimization, vol. 12, no. 4, pp. 387–394, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. K. B. Lee, B.-C. Choi, J. Y.-T. Leung, and M. L. Pinedo, “Approximation algorithms for multi-agent scheduling to minimize total weighted completion time,” Information Processing Letters, vol. 109, no. 16, pp. 913–917, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Agnetis, G. Pascale, and D. Pacciarelli, “A lagrangian approach to single-machine scheduling problems with two competing agents,” Journal of Scheduling, vol. 12, no. 4, pp. 401–415, 2009. View at Publisher · View at Google Scholar · View at Scopus
  14. W.-C. Lee, W.-J. Wang, Y.-R. Shiau, and C.-C. Wu, “A single-machine scheduling problem with two-agent and deteriorating jobs,” Applied Mathematical Modelling, vol. 34, no. 10, pp. 3098–3107, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Y.-T. Leung, M. Pinedo, and G. H. Wan, “Competitive two-agent scheduling and its applications,” Operations Research, vol. 58, no. 2, pp. 458–469, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. Q. Q. Nong, T. C. E. Cheng, and C. T. Ng, “Two-agent scheduling to minimize the total cost,” European Journal of Operational Research, vol. 215, no. 1, pp. 39–44, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. P. Liu, N. Yi, and X. Zhou, “Two-agent single-machine scheduling problems under increasing linear deterioration,” Applied Mathematical Modelling, vol. 35, no. 5, pp. 2290–2296, 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. T. C. E. Cheng, Y. H. Chung, S. C. Liao, and W. C. Lee, “Two-agent singe-machine scheduling with release times to minimize the total weighted completion time,” Computers & Operations Research, vol. 40, pp. 353–361, 2013. View at Google Scholar
  19. X. Yu, Y. Zhang, D. Xu, and Y. Yin, “Single machine scheduling problem with two synergetic agents and piece-rate maintenance,” Applied Mathematical Modelling, vol. 37, no. 3, pp. 1390–1399, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. P. Liu, N. Yi, X. Zhou, and H. Gong, “Scheduling two agents with sum-of-processing-times-based deterioration on a single machine,” Applied Mathematics and Computation, vol. 219, pp. 8848–8855, 2013. View at Google Scholar
  21. J. Du and J. Y. T. Leung, “Minimizing Total Tardiness on one Machine is NP-hard,” Mathematics of Operations Research, vol. 15, pp. 483–495, 1990. View at Google Scholar
  22. M. Soolaki, I. Mahdavi, N. Mahdavi-Amiri, R. Hassanzadeh, and A. Aghajani, “A new linear programming approach and genetic algorithm for solving airline boarding problem,” Applied Mathematical Modelling, vol. 36, no. 9, pp. 4060–4072, 2012. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Ramezanian and S. M. Mohammad, “Hybrid simulated annealing and MIP-based heuristics for stochastic lot-sizing and scheduling problem in capacitated multi-stage production system,” Applied Mathematical Modelling, vol. 37, pp. 5134–5147, 2013. View at Google Scholar
  24. E. Atmaca and A. Ozturk, “Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems,” Applied Mathematical Modelling, vol. 37, pp. 5069–5079, 2013. View at Google Scholar
  25. S. M. Goldansaz, F. Jolai, and A. H. Z. Anaraki, “A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop,” Applied Mathematical Modelling, vol. 37, no. 23, pp. 9603–9616, 2013. View at Publisher · View at Google Scholar
  26. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Google Scholar · View at Scopus
  27. D. Ben-Arieh and O. Maimon, “Annealing method for PCB assembly scheduling on two sequential machines,” International Journal of Computer Integrated Manufacturing, vol. 5, pp. 361–367, 1992. View at Google Scholar