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

Due-Window Assignment Scheduling with Variable Job Processing Times

1School of Science, Shenyang Aerospace University, Shenyang 110136, China
2Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong

Received 18 August 2014; Accepted 11 September 2014

Academic Editor: Dehua Xu

Copyright © 2015 Yu-Bin Wu and Ping Ji. 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. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. S. Gawiejnowicz, Time-Dependent Scheduling, Springer, Berlin , Germany, 2008. View at MathSciNet
  3. R. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  4. J.-B. Wang and M.-Z. Wang, “Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects,” Annals of Operations Research, vol. 191, pp. 155–169, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. L.-H. Sun, K. Cui, J.-H. Chen, J. Wang, and X.-C. He, “Research on permutation flow shop scheduling problems with general position-dependent learning effects,” Annals of Operations Research, vol. 211, pp. 473–480, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. L.-H. Sun, K. Cui, J.-H. Chen, J. Wang, and X.-C. He, “Some results of the worst-case analysis for flow shop scheduling with a learning effect,” Annals of Operations Research, vol. 211, pp. 481–490, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  7. Y. Y. Lu, G. Li, Y. B. Wu, and P. Ji, “Optimal due-date assignment problem with learning effect and resource-dependent processing times,” Optimization Letters, vol. 8, no. 1, pp. 113–127, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. J.-B. Wang and M.-Z. Wang, “Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times,” Asia-Pacific Journal of Operational Research, vol. 31, no. 5, Article ID 1450036, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  9. J.-B. Wang and M.-Z. Wang, “Single-machine scheduling with nonlinear deterioration,” Optimization Letters, vol. 6, no. 1, pp. 87–98, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. J.-B. Wang and M.-Z. Wang, “Minimizing makespan in three-machine flow shops with deteriorating jobs,” Computers and Operations Research, vol. 40, no. 2, pp. 547–557, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. X.-R. Wang and J.-J. Wang, “Single-machine scheduling with convex resource dependent processing times and deteriorating jobs,” Applied Mathematical Modelling, vol. 37, no. 4, pp. 2388–2393, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Y.-T. Xu, Y. Zhang, and X. Huang, “Single-machine ready times scheduling with group technology and proportional linear deterioration,” Applied Mathematical Modelling, vol. 38, no. 1, pp. 384–391, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. T. C. E. Cheng, S.-J. Yang, and D.-L. Yang, “Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity,” International Journal of Production Economics, vol. 135, no. 1, pp. 154–161, 2012. View at Publisher · View at Google Scholar · View at Scopus
  14. S.-J. Yang, H.-T. Lee, and J.-Y. Guo, “Multiple common due dates assignment and scheduling problems with resource allocation and general position-dependent deterioration effect,” International Journal of Advanced Manufacturing Technology, vol. 67, no. 1–4, pp. 181–188, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. J. Liu, Y. Wang, and X. Min, “Single-machine scheduling with common due-window assignment for deteriorating jobs,” Journal of the Operational Research Society, vol. 65, no. 2, pp. 291–301, 2014. View at Publisher · View at Google Scholar · View at Scopus
  16. J.-B. Wang and C. Wang, “Single-machine due-window assignment problem with learning effect and deteriorating jobs,” Applied Mathematical Modelling, vol. 35, no. 8, pp. 4017–4022, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. 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, no. 18-19, pp. 8394–8400, 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. S. Li, C. T. Ng, and J. Yuan, “Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine,” International Journal of Production Economics, vol. 131, no. 2, pp. 747–751, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Yin, T. C. E. Cheng, C.-J. Hsu, and C.-C. Wu, “Single-machine batch delivery scheduling with an assignable common due window,” Omega, vol. 41, no. 2, pp. 216–225, 2013. View at Publisher · View at Google Scholar · View at Scopus
  20. 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 Zentralblatt MATH · View at Scopus
  21. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. 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 MathSciNet · View at Scopus
  22. G. H. Hardy, J. E. Littlewood, and G. Polya, Inequalities, Cambridge University Press, Cambridge, UK, 1967.