Skip to main content
SpringerLink
Log in

Maximizing set function formulation of two scheduling problems

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

In this note we consider two problems: (1) Schedulingn jobs non-preemptively on a single machine to minimize total weighted earliness and tardiness (WET). (2) Schedulingn jobs nonpreemptively on two parallel identical processors to minimize weighted mean flow time (WMFT). A new approach for these problems is presented. The approach is based on a problem of maximizing a submodular set function. Heuristic algorithm for the problems also is presented.

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. Baker KR (1974) Introduction to Sequencing and Scheduling. Wiley, New York

    Google Scholar 

  2. Baker KR, Scudder G (1990) Sequencing with Earliness and Tardiness Penalties: A Review. Operat Res 38:22–36

    Google Scholar 

  3. Bruno J, Coffman EG, Sethi R (1974) Scheduling Independent Tasks to Reduce Mean Finishing-time. Comm ACM 17:382–387

    Google Scholar 

  4. Cheng TC, Gupta M (1989) Survey of Scheduling Research Involving Due Date Determination Decisions. Eur J Oper Res 38:156–166

    Google Scholar 

  5. Eastman WL, Even S, Isaacs IM (1964) Bounds for the Optimal Scheduling ofn Jobs onm Processors. Mgmt Sci 11:268–279

    Google Scholar 

  6. Fujishige S (1983) Canonical Decompositions of Symmetric Submodular Systems. Discr Appl Math 5:175–190

    Google Scholar 

  7. Hall N, Posner M (1991) Earliness-Tardiness scheduling Problems I: Weighted Deviation of Completion Times About a Common Due Date. Operat Res 39:836–846

    Google Scholar 

  8. Nemhauser GL, Wolsey LA, Fisher ML (1978) An Analysis of Approximations for Maximizing Submodular Set Functions-I. Math Prog 14:265–294

    Google Scholar 

  9. Nemhauser GL, Wolsey LA (1978) Best Algorithms for Approximating the Maximum Submodular Set Function. Math Oper Res 3:177–188

    Google Scholar 

  10. Rothkopf MH (1966) Scheduling Independent Tasks on Parallel Processors. Mgmt Sci 12:437–447

    Google Scholar 

  11. Sahni SK (1976) Algorithm for Scheduling Independent Tasks. J ACM 23:116–127

    Google Scholar 

  12. Wolsey LA (1982) Maximizing Real-valued Submodular Functions: Primal and Dual Heuristics for Location Problems. Math Oper Res 7:410–425

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Physical Sciences Department, West Texas State University, 79016, Canyon, TX

    B. Alidaee

Authors
  1. B. Alidaee
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alidaee, B. Maximizing set function formulation of two scheduling problems. ZOR - Methods and Models of Operations Research 36, 409–416 (1992). https://doi.org/10.1007/BF01415757

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01415757

Key words

Search

Navigation