Skip to main content
SpringerLink
Log in

Scheduling jobs with deterioration effect and controllable processing time

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

This article considered the single machine scheduling with controllable processing time (resource allocation) and deterioration effect concurrently. It discussed the minimization of three objectives, which involve the weighted sum of the makespan and the total resource consumption cost, the total resource consumption cost under the condition that the makespan (total flow time) is restricted to a fixed constant and the optimal resource allocation and the optimal job sequence is what we need to make decision. Considering the makespan constraint, it proved that these problems can be solved in polynomial time. A special case of the last problem can be solved in polynomial time with respect to the total flow time constraint.

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

Access this article

Log in via an institution

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

  1. Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin

    MATH  Google Scholar 

  2. 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 

  3. Hardy GH, Littlewood JE, Polya G (1967) Inequalities, 2nd edn. Cambridge University Press, Cambridge

    MATH  Google Scholar 

  4. 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 

  5. Lu YY, Li G, Wu YB, 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 

  6. 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 

  7. Oron D (2014) Scheduling controllable processing time jobs in a deteriorating environment. J Oper Res Soc 64:49–56

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Wang JB, Wang MZ (2012) Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. Comput Oper Res 39:492–497

    Article  MathSciNet  MATH  Google Scholar 

  10. Wang XR, Wang JJ (2013) Single-machine scheduling with convex resource dependent processing times and deteriorating jobs. Appl Math Model 37:2388–2393

    Article  MathSciNet  MATH  Google Scholar 

  11. Wang XY, Wang JJ (2013) Single-machine due date assignment problem with deteriorating jobs and resource-dependent processing times. Int J Adv Manuf Technol 67:255–260

    Article  Google Scholar 

  12. Wang JB, Wang MZ, Ji P (2012) Scheduling jobs with processing times dependent on position, starting time and allotted resource. Asia Pac J Oper Res 29:1250030

    Article  MathSciNet  MATH  Google Scholar 

  13. Wei CM, Wang JB, Ji P (2012) Single-machine scheduling with time-and-resource-dependent processing times. Appl Math Model 62:792–798

    Article  MathSciNet  MATH  Google Scholar 

  14. Yin YQ, Cheng TCE, Cheng SR, Wu CC (2013) Single-machine batch delivery scheduling with an assignment common due date and controllable processing times. Comput Ind Eng 65:652–662

    Article  Google Scholar 

  15. Yin YQ, Cheng TCE, Wu CC (2014) Scheduling with time-dependent processing times. Math Probl Eng. Article ID 201421 (2 pages)

  16. Yin YQ, Cheng TCE, Wu CC (2015) Scheduling with time-dependent processing times 2015. Math Probl Eng. Article ID 367585 (2 pages)

  17. Yin YQ, Cheng TCE, Wu CC, Cheng SR (2013) Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times. Int J Prod Res 51:5083–5099

    Article  Google Scholar 

  18. Yin YQ, Cheng TCE, Wu CC, Cheng SR (2014) Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time. J Oper Res Soc 65:1–13

    Article  Google Scholar 

Download references

Acknowledgements

We are grateful to the anonymous referees for their helpful comments on an earlier versions of this paper. This research was supported by the National Natural Science Foundation of China (Grant Nos. 61403260, 71271039, 71471120, 71672019), the New Century Excellent Talents in University (Grant No. NCET-13-0082), and the Fundamental Research Funds for the Central Universities (Grant No. DUT14YQ211).

Author information

Authors and Affiliations

  1. College of Science, Shenyang Aerospace University, Shenyang, 110136, China

    Lin Li

  2. Faculty of Management and Economics, Dalian University of Technology, Dalian, China

    Jian-Jun Wang

Authors
  1. Lin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jian-Jun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lin Li.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, L., Wang, JJ. Scheduling jobs with deterioration effect and controllable processing time. Neural Comput & Applic 29, 1163–1170 (2018). https://doi.org/10.1007/s00521-016-2630-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-016-2630-z

Keywords

Search

Navigation