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

Scheduling Jobs with Variable Job Processing Times on Unrelated Parallel Machines

Faculty of Management and Economics, Dalian University of Technology, Dalian 116024, China

Received 21 March 2014; Accepted 30 April 2014; Published 26 May 2014

Academic Editor: Chin-Chia Wu

Copyright © 2014 Guang-Qian Zhang 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. B. Alidaee and N. K. Womer, “Scheduling with time dependent processing times: review and extensions,” Journal of the Operational Research Society, vol. 50, no. 7, pp. 711–720, 1999. View at Google Scholar · View at Scopus
  2. T. C. E. Cheng, Q. Ding, and B. M. T. Lin, “A concise survey of scheduling with time-dependent processing times,” European Journal of Operational Research, vol. 152, no. 1, pp. 1–13, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Gawiejnowicz, Time-Dependent Scheduling, Springer, Berlin, Germany, 2008.
  4. D. Biskup, “A state-of-the-art review on scheduling with learning effects,” European Journal of Operational Research, vol. 188, no. 2, pp. 315–329, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. D. Shabtay and G. Steiner, “A survey of scheduling with controllable processing times,” Discrete Applied Mathematics, vol. 155, no. 13, pp. 1643–1666, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Bai, Z.-R. Li, and X. Huang, “Single-machine group scheduling with general deterioration and learning effects,” Applied Mathematical Modelling, vol. 36, no. 3, pp. 1267–1274, 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. J. Bai, M.-Z. Wang, and J.-B. Wang, “Single machine scheduling with a general exponential learning effect,” Applied Mathematical Modelling, vol. 36, no. 2, pp. 829–835, 2012. View at Publisher · View at Google Scholar · View at Scopus
  8. T. C. E. Cheng, C.-J. Hsu, and D.-L. Yang, “Unrelated parallel-machine scheduling with deteriorating maintenance activities,” Computers and Industrial Engineering, vol. 60, no. 4, pp. 602–605, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Gorczyca and A. Janiak, “Resource level minimization in the discrete-continuous scheduling,” European Journal of Operational Research, vol. 203, no. 1, pp. 32–41, 2010. View at Publisher · View at Google Scholar · View at Scopus
  10. C.-J. Hsu and D.-L. Yang, “Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time,” Optimization Letters, vol. 8, pp. 519–531, 2014. View at Publisher · View at Google Scholar
  11. X. Huang and M.-Z. Wang, “Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties,” Applied Mathematical Modelling, vol. 35, no. 3, pp. 1349–1353, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. W.-C. Lee, C.-C. Wu, Y.-H. Chung, and H.-C. Liu, “Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates,” Computers and Operations Research, vol. 36, no. 6, pp. 2111–2121, 2009. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Leyvand, D. Shabtay, and G. Steiner, “A unified approach for scheduling with convex resource consumption functions using positional penalties,” European Journal of Operational Research, vol. 206, no. 2, pp. 301–312, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. H. Nian and Z. Mao, “Single-machine scheduling with job rejection, deteriorating effects, and deteriorating maintenance activities,” Mathematical Problems in Engineering, vol. 2013, Article ID 389120, 9 pages, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  15. D. Shabtay and G. Steiner, “The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times,” Annals of Operations Research, vol. 159, no. 1, pp. 25–40, 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. J.-B. Wang, L. Liu, and C. Wang, “Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs,” Applied Mathematical Modelling, vol. 37, pp. 8394–8400, 2013. View at Publisher · View at Google Scholar
  17. J.-B. Wang and M.-Z. Wang, “Worst-case analysis for flow shop scheduling problems with an exponential learning effect,” Journal of the Operational Research Society, vol. 63, no. 1, pp. 130–137, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. 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 Google Scholar
  19. J.-B. Wang, M.-Z. Wang, and P. Ji, “Scheduling jobs with processing times dependent on position, starting time and allotted resource,” Asia-Pacific Journal of Operational Research, vol. 29, Article ID 1250030, 2012. View at Publisher · View at Google Scholar
  20. J.-B. Wang, X.-Y. Wang, L.-H. Sun, and L.-Y. Sun, “Scheduling jobs with truncated exponential learning functions,” Optimization Letters, vol. 7, no. 8, pp. 1857–1873, 2011. View at Publisher · View at Google Scholar · View at Scopus
  21. D. Wang, M.-Z. Wang, and J.-B. Wang, “Single-machine scheduling with learning effect and resource-dependent processing times,” Computers and Industrial Engineering, vol. 59, no. 3, pp. 458–462, 2010. View at Publisher · View at Google Scholar · View at Scopus
  22. C.-M. Wei, J.-B. Wang, and P. Ji, “Single-machine scheduling with time-and-resource-dependent processing times,” Applied Mathematical Modelling, vol. 36, no. 2, pp. 792–798, 2012. View at Publisher · View at Google Scholar · View at Scopus
  23. C.-C. Wu and W.-C. Lee, “Single-machine and flowshop scheduling with a general learning effect model,” Computers and Industrial Engineering, vol. 56, no. 4, pp. 1553–1558, 2009. View at Publisher · View at Google Scholar · View at Scopus
  24. C.-C. Wu and C.-L. Liu, “Minimizing the makespan on a single machine with learning and unequal release times,” Computers and Industrial Engineering, vol. 59, no. 3, pp. 419–424, 2010. View at Publisher · View at Google Scholar · View at Scopus
  25. D.-L. Yang and W.-H. Kuo, “Some scheduling problems with deteriorating jobs and learning effects,” Computers and Industrial Engineering, vol. 58, no. 1, pp. 25–28, 2010. View at Publisher · View at Google Scholar · View at Scopus
  26. S.-J. Yang and D.-L. Yang, “Single-machine group scheduling problems under the effects of deterioration and learning,” Computers and Industrial Engineering, vol. 58, no. 4, pp. 754–758, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. D. L. Yang, T. C. E. Cheng, and S. J. Yang, “Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions,” International Journal of Production Research, vol. 52, no. 4, pp. 1133–1141, 2014. View at Publisher · View at Google Scholar
  28. Y. Yin, T. C. E. Cheng, C. C. Wu, and S. R. Cheng, “Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times,” International Journal of Production Research, vol. 51, pp. 5083–5099, 2013. View at Publisher · View at Google Scholar
  29. Y. Yin, T. C. E. Cheng, C. C. Wu, and S. R. Cheng, “Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time,” Journal of the Operational Research Society, vol. 65, pp. 1–13, 2014. View at Google Scholar
  30. N. Yin, L. Kang, T. C. Sun, C. Yue, and X. R. Wang, “Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times,” Applied Mathematical Modelling, 2014. View at Publisher · View at Google Scholar
  31. N. Yin, L. Kang, and X. Y. Wang, “Single-machine group scheduling with processing times dependent on position, starting time and allotted resource,” Applied Mathematical Modelling, 2014. View at Publisher · View at Google Scholar
  32. C. L. Zhao and H. Y. Tang, “Single machine scheduling problems with general positiondependent processing times and past-sequence-dependent delivery times,” Journal of Applied Mathematics and Computing, vol. 45, no. 1-2, pp. 259–274, 2014. View at Publisher · View at Google Scholar
  33. G. Mosheiov and J. B. Sidney, “Scheduling with general job-dependent learning curves,” European Journal of Operational Research, vol. 147, no. 3, pp. 665–670, 2003. View at Publisher · View at Google Scholar · View at Scopus
  34. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979. View at Publisher · View at Google Scholar · View at Scopus
  35. J. J. Kanet, “Minimizing variation of flow time in single machine systems,” Management Science, vol. 27, no. 12, pp. 1453–1464, 1981. View at Google Scholar · View at Scopus
  36. U. Bagchi, “Simultaneous minimization of mean and variation of flow time and waiting time in single machine systems,” Operations Research, vol. 37, no. 1, pp. 118–125, 1989. View at Google Scholar · View at Scopus