Single machine due window assignment resource allocation scheduling with job-dependent learning effect

Original Research
  • 43 Downloads

Abstract

This paper deals with a single machine common due window assignment resource allocation scheduling problem with job-dependent learning effect. The objective is to find the due window starting time, a due window size, resource allocation and a job schedule such that total resource consumption cost is minimized subject to a cost function associated with the window location, window size, earliness, tardiness and makespan is less than or equal to a fixed constant number. We show that the problem can be solved in polynomial time. Some extensions of the problem are also given.

Keywords

Scheduling Single-machine Due-window Resource allocation Learning effect 

Mathematics Subject Classification

90B35 68M20 

Notes

Acknowledgements

This research was supported by the National Natural Science Foundation of China (Grant no. 71471120) and the Program for Liaoning Natural Science Foundation Research (Grant no. 201601177).

References

  1. 1.
    Biskup, D.: A state-of-the-art review on scheduling with learning effects. Eur. J. Oper. Res. 188, 315–329 (2008)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287–326 (1979)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Hardy, G.H., Littlewood, J.E., Polya, G.: Inequalities, 2nd edn. Cambridge University Press, Cambridge (1952)MATHGoogle Scholar
  4. 4.
    Janiak, A., Janiak, W.A., Krysiak, T., Kwiatkowski, T.: A survey on scheduling problems with due windows. Eur. J. Oper. Res. 242, 347–357 (2015)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Li, G., Luo, M.-L., Zhang, W.-J., Wang, X.-Y.: Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int. J. Prod. Res. 53, 1228–1241 (2015)CrossRefGoogle Scholar
  6. 6.
    Liman, S.D., Panwalkar, S.S., Thongmee, S.: Determination of common due window location in a single machine scheduling problem. Eur. J. Oper. Res. 93, 68–74 (1996)CrossRefMATHGoogle Scholar
  7. 7.
    Liman, S.D., Panwalkar, S.S., Thongmee, S.: Common due window size and location determination in a single machine scheduling problem. J. Oper. Res. Soc. 49, 1007–1010 (1998)CrossRefMATHGoogle Scholar
  8. 8.
    Liu, L., Wang, J.-J., Wang, X.-Y.: Single machine due-window assignment scheduling with resource-dependent processing times to minimize total resource consumption cost. Int. J. Prod. Res. 54, 1186–1195 (2015)CrossRefGoogle Scholar
  9. 9.
    Lu, Y.-Y., Li, G., Wu, Y.-B., Ji, P.: Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim. Lett. 8, 113–127 (2014)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Niu, Y.-P., Wang, J., Yin, N.: Scheduling problems with effects of deterioration and truncated job-dependent learning. J. Appl. Math. Comput. 47, 315–325 (2015)MathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Shabtay, D., Steiner, G.: A survey of scheduling with controllable processing time. Discrete Appl. Math. 115(13), 1643–1666 (2007)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Wang, X.-Y., Li, L., Wang, J.-B.: Study on due-window scheduling with controllable processing times and learning effect. ICIC Express Lett. 10, 2913–2919 (2016)Google Scholar
  13. 13.
    Wang, J.-B., Wang, M.-Z.: Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia-Pac. J. Oper. Res. 31(5), 1450036 (2014)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Wang, J.-B., Wang, J.-J.: Research on scheduling with job-dependent learning effect and convex resource dependent processing times. Int. J. Prod. Res. 53, 5826–5836 (2015)CrossRefGoogle Scholar
  15. 15.
    Wang, X.-R., Wang, J.-B., Jin, J., Ji, P.: Single machine scheduling with truncated job-dependent learning effect. Optim. Lett. 8(2), 669–677 (2014)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Wang, D., Wang, M.-Z., Wang, J.-B.: Single-machine scheduling with learning effect and resource-dependent processing times. Comput. Ind. Eng. 59, 458–462 (2010)CrossRefGoogle Scholar
  17. 17.
    Wu, C.-C., Yin, Y., Cheng, S.-R.: Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J. Oper. Res. Soc. 64, 147–156 (2013)CrossRefGoogle Scholar
  18. 18.
    Wu, C.-C., Yin, Y., Wu, W.-H., Cheng, S.-R.: Some polynomial solvable single-machine scheduling problems with a truncation sum-of-processing-times based learning effect. Eur. J. Ind. Eng. 6, 441–453 (2012)CrossRefGoogle Scholar
  19. 19.
    Yang, D.-L., Lai, C.-J., Yang, S.-J.: Scheduling problems with multiple due windows assignment and controllable processing times on a single machine. Int. J. Prod. Econ. 150, 96–103 (2014)CrossRefGoogle Scholar
  20. 20.
    Yin, Y., Cheng, T.C.E., Wu, C.-C., Cheng, S.-R.: Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J. Oper. Res. Soc. 65, 1–13 (2014)CrossRefGoogle Scholar

Copyright information

© Korean Society for Computational and Applied Mathematics 2017

Authors and Affiliations

  1. 1.School of ScienceShenyang Aerospace UniversityShenyangChina

Personalised recommendations