Skip to main content
SpringerLink
Log in

Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times

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

Abstract

In this paper we study the problem of scheduling n jobs on a single machine with availability constraints. The objective is to minimize total weighted job completion times. We show that the problem is NP-hard in the strong sense. Then we consider two intractable special cases, namely, proportional weight case, and single availability constraint case. We propose two heuristics for these cases and analyze their worst-case error bounds.

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

  • Adiri, I., J. Bruno, and A.H.G. Rinnooy Kan. (1989). “Single Machine Flow-Time Scheduling with a Single Breakdown.” Acta Informatica 26, 679–696.

    Article  Google Scholar 

  • Garey, M.R. and D.S. Johnson. (1979). Computer and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman.

    Google Scholar 

  • Goemans, M.X., M. Queyranne, A.S. Schulz, M. Skutella, and Y. Wang. (2002). “Single Machine Scheduling with Release Dates.” SIAM Journal on Discrete Mathematics 15, 165–192.

    Article  Google Scholar 

  • Goemans, M.X., J.M. Wein, and D.P. Williamson. (2000). “A 1.47 Approximation Algorithm for a Preemptive Single-Machine Scheduling Problem.” Operations Research Letters 26, 149–154.

    Article  Google Scholar 

  • Graham, R.L., E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan. (1979). “Optimization and Approximation in Deterministic Machine Scheduling: A Survey.” Annals of Discrete Mathematics 5, 287–326.

    Article  Google Scholar 

  • Lee, C.-Y. (1996). “Machine Scheduling with an Availability Constraint.” Journal of Global Optimization 9, 395–416.

    Article  Google Scholar 

  • Lee, C.-Y., L. Lei, and M. Pinedo. (1997). “Current Trends in Deterministic Scheduling.” Annals of Operations Research 70, 1–42.

    Google Scholar 

  • Lee, C.-Y. and S.D. Liman. (1992). “Single Machine Flowtime Scheduling with Scheduled Maintenance.” Acta Informatica 29, 375–382.

    Article  Google Scholar 

  • Sanlaville, E. and G. Schmidt. (1998). “Machine Scheduling with Availability Constraints.” Acta Informatica 35, 795–811.

    Article  Google Scholar 

  • Schmidt, G. (2000). “Scheduling with Limited Availability.” European Journal of Operational Research 121, 1–15.

    Article  Google Scholar 

  • Schulz, A.S. and M. Skutella. (1997). “The Power of α-Points in Preemptive Single Machine Scheduling.” Technical Report, Technische Universität Berlin, Fachbereich Mathematik.

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, Jinan University, Guangzhou, P.R. China

    Guoqing Wang

  2. Department of Manufacturing Engineering and Engineering Management, University of Hong Kong, Hong Kong

    Hongyi Sun

  3. LOSI, Université de Technologie de Troyes, 12 rue Marie Curie, B.P. 2060, 10010, Troyes Cedex, France

    Chengbin Chu

Authors
  1. Guoqing Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hongyi Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chengbin Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guoqing Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, G., Sun, H. & Chu, C. Preemptive Scheduling with Availability Constraints to Minimize Total Weighted Completion Times. Ann Oper Res 133, 183–192 (2005). https://doi.org/10.1007/s10479-004-5032-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-004-5032-z

Keywords

Search

Navigation