Skip to main content
SpringerLink
Log in

Single machine scheduling with controllable processing times and compression costs

Part II: Heuristics for the general case

  • Published:
Applied Mathematics-A Journal of Chinese Universities Aims and scope Submit manuscript

Abstract

A single machine scheduling problem with controllable processing times and compression costs is considered. The objective is to find an optimal sequence to minimize the cost of completion times and the cost of compression. The complexity of this problem is still unknown. In Part I of this paper, the authors have considered a special case where the compression times and the compression costs are equal among all jobs. Such a problem appears polynomially solvable by developing an O(n 2) algorithm. In this part(Part II), a general case where the controllable processing times and the compression costs are not equal is discussed. Authors propose here two heuristics with the first based on some previous work and the second based on the algorithm developed in Part I. Computational results are presented to show the efficiency and the robustness of these heuristics.

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. Vickson, R. G., Choosing the job sequence and processing times to minimize total processing puls flow cost on single machine, Oper. Res., 1980, 28:1155–1167.

    Article  MATH  MathSciNet  Google Scholar 

  2. Smith, W. E., Various optimizers for single-stage production, Naval Res. Logist., 1956, 3: 59–66.

    Article  Google Scholar 

  3. Fisher, M., Worst-case analysis of heuristic algorithms, Management Sciences, 1980, 26: 1–17.

    MATH  Google Scholar 

  4. Tang Guochun, and Foulds, L. R., Single machine scheduling with controllable processing times and compression costs (Part I: equal compression times and costs) Appl. Math.-JCU, Ser B, 1998, 13(4): 417–426.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Management System, Univ. of Waikato, Hamilton, New Zealand

    Foulds L. R. & Tang Guochun

  2. Dept. of Management, Shanghai Second Polytechnic Univ., 200002, Shanghai

    Foulds L. R. & Tang Guochun

Authors
  1. Foulds L. R.
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tang Guochun
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by the National Natural Science Foundation of China (69484003) to the second anthor.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Foulds, L.R., Guochun, T. Single machine scheduling with controllable processing times and compression costs. Appl. Math. Chin. Univ. 14, 75–84 (1999). https://doi.org/10.1007/s11766-999-0057-3

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11766-999-0057-3

1991 MR Subject Classification

Key words

Search

Navigation