Skip to main content
SpringerLink
Log in

Single machine scheduling with total tardiness criterion and convex controllable processing times

  • Short Note
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n 2) is presented for the special case where jobs have a common due date.

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

References

  • Biskup, D., & Cheng, T. C. E. (1999). Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Engineering Optimization, 31(3), 329–336.

    Article  Google Scholar 

  • Du, J. & Leung, J. Y. T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15(3), 485–495.

    Article  Google Scholar 

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5(1), 287–326.

    Article  Google Scholar 

  • Janiak, A. (1986). One-machine scheduling problems with resource constraints. Lecture Notes in Control and Information Sciences, 84(1986), 358–364.

    Article  Google Scholar 

  • Kaspi, M., & Shabtay, D. (2004). Convex resource allocation for minimizing the makespan in a single machine with job release dates. Computers and Operations Research, 31(9), 1481–1489.

    Article  Google Scholar 

  • Monma, C. L., Schrijver, A., Todd, M. J., & Wei, V. K. (1990). Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Mathematics of Operations Research, 15, 736–748.

    Article  Google Scholar 

  • Shabtay, D., & Kaspi, M. (2004). Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research, 31(13), 2279–2289.

    Article  Google Scholar 

  • Shabtay, D., & Kaspi, M. (2006). Parallel machine scheduling with a convex resource consumption function. European Journal of Operational Research, 173(1), 92–107.

    Article  Google Scholar 

  • Shabtay, D., Kaspi, M., & Steiner, G. (2007). The no-wait two-machine flow-shop scheduling problem with convex resource-dependent processing times. IIE Transactions, 39(5), 539–557.

    Article  Google Scholar 

  • Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643–1666.

    Article  Google Scholar 

  • Vickson, R. G. (1980). Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research, 28(5), 1155–1167.

    Article  Google Scholar 

  • Xu, K., Feng, Z., & Jun, K. (2010a). A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Computers and Operations Research, 37(11), 1924–1938.

    Article  Google Scholar 

  • Xu, K., Feng, Z., & Ke, L. (2010b). A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates. Annals of Operations Research, 181(1), 303–324.

    Article  Google Scholar 

  • Zdrzalka, S. (1991). Scheduling jobs on a single machine with release dates, delivery times, and controllable processing times: worst-case analysis. Operations Research Letters, 10(9), 519–523.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The School of Electronic and Information Engineering, Xi’an Jiaotong University, Xi’an, Shannxi, P.R. China

    Kailiang Xu, Zuren Feng & Liangjun Ke

Authors
  1. Kailiang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zuren Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liangjun Ke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Liangjun Ke.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, K., Feng, Z. & Ke, L. Single machine scheduling with total tardiness criterion and convex controllable processing times. Ann Oper Res 186, 383–391 (2011). https://doi.org/10.1007/s10479-010-0827-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-010-0827-6

Keywords

Search

Navigation