Skip to main content

Scheduling with Multiple Criteria

  • Conference paper
Multiple Criteria Decision Making

Abstract

In this study we consider the bicriteria problem of minimizing total flowtime and maximum tardiness penalties for a given set of jobs on a single machine. We discuss some properties of the efficient solutions and develop an algorithm that generates all efficient schedules in polynomial time.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Azizoğlu, M. and Kondakci, S., “Scheduling with Dual Performance Measures: Flowtime and Maximum Tardiness,” Technical Report, No: 90–12, IE Department, METU, (1990).

    Google Scholar 

  2. Azizoğlu, M., Kondakci, S. and Kirca, O., “Bicriteria Scheduling Problem Involving Total Tardiness and Total Earliness Penalties,” International J. Production Economics, 23, (1991), 17–24.

    Article  Google Scholar 

  3. Emmons, H., “One Machine Sequencing to Minimize Mean Flow Time with Minumum Tardy,” Naval Research Logistics Quarterly, 22, (1975), 585–592.

    Article  MathSciNet  MATH  Google Scholar 

  4. Heck, H. and Roberts, S., “A Note on the Extention of a Result on Scheduling with Secondary Criteria,” Naval Research Logistics Quarterly, 19, (1972), 403–405.

    Article  MathSciNet  MATH  Google Scholar 

  5. Kiran, A.S. and Unal, A.T., “A Single-Machine Problem with Multiple Criteria,” Naval Research Logistics Quarterly, 38, (1991), 721–727.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lin, K.S., “Hybrid Algorithm for Sequencing with Bicriteria,” Journal of Optimization Theory and Applications, 39, (1983), 105–124.

    Article  MathSciNet  MATH  Google Scholar 

  7. Nelson, R.T., Sarin, R.K., and Daniels, R.L., “Scheduling with Multiple Performance Measures: The One Machine Case,” Management Science, 32, (1986), 464–479.

    Article  MATH  Google Scholar 

  8. Sen, T. and Gupta, S.K., “A Branch and Bound Procedure to Solve a Bicriterion Scheduling Problem,” HE Transactions, 15, (1983), 84–88.

    Google Scholar 

  9. Smith, W.E., “Various Optimizers for Single Stage Production,” Naval Research Logistics Quaterly, 3 (1956), 59–66

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag New York, Inc.

About this paper

Cite this paper

Köksalan, S.K., Azizoğlu, M., Köksalan, M. (1994). Scheduling with Multiple Criteria. In: Tzeng, G.H., Wang, H.F., Wen, U.P., Yu, P.L. (eds) Multiple Criteria Decision Making. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2666-6_37

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2666-6_37

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7626-5

  • Online ISBN: 978-1-4612-2666-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics