Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Resource constrained scheduling with general truncated job-dependent learning effect

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Scheduling with general truncated job-dependent learning effect and resource-dependent processing times is studied on a single machine. It is assumed that the job processing time is a function of the amount of resource allocated to the job, the general job-dependent learning effect and the job-dependent control parameter. For each version of the problem that differs in terms of the objective functions and the processing time functions, the optimal resource allocation is provided. Polynomial time algorithms are also developed to find the optimal schedule of several versions of the problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adamopoulos GI, Pappis CP (1996) Single machine scheduling with flow allowances. J Oper Res Soc 47:1280–1285

    Article  MATH  Google Scholar 

  • Badiru AB (1992) Computational survey of univariate and multivariate learning curve models. IEEE Trans Eng Manag 39:176–188

    Article  Google Scholar 

  • Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178

    Article  MATH  Google Scholar 

  • Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329

    Article  MathSciNet  MATH  Google Scholar 

  • Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287–326

    Article  MathSciNet  MATH  Google Scholar 

  • Kanet JJ (1981) Minimizing variation of flow time in single machine systems. Manag Sci 27:1453–1459

    Article  MATH  Google Scholar 

  • Karush W (1939) Minima of functions of several variables with inequalities as side conditions. MS thesis, Department of Mathematics, University of Chicago

  • Kaspi M, Shabtay D (2004) Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput Oper Res 31:1481–1489

    Article  MathSciNet  MATH  Google Scholar 

  • Kuhn HW, Tucker AW (1951) Nonlinear programming. Proceedings of the second symposium. University of California Press, Berkeley, pp 481–492

    MATH  Google Scholar 

  • Li G, Luo M-L, Zhang W-J, Wang X-Y (2015) Single-machine due-window assignment scheduling based on common flow allowance, learning effect and resource allocation. Int J Prod Res 53:1228–1241

    Article  Google Scholar 

  • Lu Y-Y, Li G, Wu Y-B, Ji P (2014) Optimal due-date assignment problem with learning effect and resource-dependent processing times. Optim Lett 8:113–127

    Article  MathSciNet  MATH  Google Scholar 

  • Monma CL, Schrijver A, Todd MJ, Wei VK (1990) Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Math Oper Res 15:736–748

    Article  MathSciNet  MATH  Google Scholar 

  • Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665–670

    Article  MathSciNet  MATH  Google Scholar 

  • Panwalker SS, Smith ML, Seidmann A (1982) Common due-date assignment to minimize total penalty for the one machine scheduling problem. Oper Res 30:391–399

    Article  MATH  Google Scholar 

  • Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: algorithms and complexity. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

  • Rustogi K, Strusevich VA (2012) Simple matching vs linear assignment in scheduling models with positional effects: a critical review. Eur J Oper Res 222:393–407

    Article  MathSciNet  MATH  Google Scholar 

  • Seidmann A, Panwalkar SS, Smith ML (1981) Optimal assignment of due dates for a single processor scheduling problem. Int J Prod Res 19:393–399

    Article  Google Scholar 

  • Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155(13):1643–1666

    Article  MathSciNet  MATH  Google Scholar 

  • Shabtay D, Steiner G (2011) A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates. J Sched 14:455–469

    Article  MathSciNet  MATH  Google Scholar 

  • Wang X-R, Jin J, Wang J-B, Ji P (2014) Single machine scheduling with truncated job-dependent learning effect. Optim Lett 8:669–677

    Article  MathSciNet  MATH  Google Scholar 

  • Wang JB, Wang MZ (2014) Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times. Asia Pac J Oper Res 31:1450036

    Article  MathSciNet  MATH  Google Scholar 

  • Wang J-B, Wang J-J (2015) Research on scheduling with job-dependent learning effect and convex resource dependent processing times. Int J Prod Res 53:5826–5836

    Article  Google Scholar 

  • Wang D, Wang M-Z, Wang J-B (2010) Single-machine scheduling with learning effect and resource-dependent processing times. Comput Ind Eng 59:458–462

    Article  Google Scholar 

  • Wu C-C, Yin Y, Cheng S-R (2013) Single-machine and two-machine flowshop scheduling problems with truncated position-based learning functions. J Oper Res Soc 64:147–156

    Article  Google Scholar 

Download references

Acknowledgments

The authors are grateful to the two anonymous referees for their helpful comments on earlier version of the article. This research was supported by the National Natural Science Foundation of China (Grant Nos. 71471120 and 71471057).

Author information

Authors and Affiliations

  1. Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing, 100871, People’s Republic of China

    Hongyu He

  2. Business School, Hunan University, Changsha, 410082, Hunan, People’s Republic of China

    Mengqi Liu

  3. School of Science, Shenyang Aerospace University, Shenyang, 110136, People’s Republic of China

    Ji-Bo Wang

Authors
  1. Hongyu He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mengqi Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mengqi Liu.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

He, H., Liu, M. & Wang, JB. Resource constrained scheduling with general truncated job-dependent learning effect. J Comb Optim 33, 626–644 (2017). https://doi.org/10.1007/s10878-015-9984-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-015-9984-5

Keywords

Search

Navigation