Skip to main content
SpringerLink
Log in
Book cover

Generalized Convexity pp 386–391Cite as

Multiobjective scheduling problems

  • Conference paper

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 405))

Abstract

Most scheduling problems considered so far treat a single objective function only. Scheduling problems of real productions essentially have not a single but multiple criteria. Studies in general, except ours, treat one processor case. We have already investigated two processor open shop cases with bicriteria, i.e. L max (maximum lateness) and C max (maximum completion time), and uniform processor case with same criteria. The paper considers the unrelated parallel processor problem with the same bicriteria.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Blazewicz, Selected Topics in Scheduling Theory, Annals of Discrete Mathematics 31 (1987) pp. 1–60.

    Google Scholar 

  2. H. Ishii, M. Tada and T. Nishida, Bi-Criteria Scheduling Problem on Uniform Processors, Mathematica Japonica 35 (1990) pp. 515–519.

    Google Scholar 

  3. E. L. Lawler and J. Labertoulle, On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming, Journal of the Association for Computing Machinery 25 (1978) pp. 612–619.

    Article  Google Scholar 

  4. T. Masuda and H. Ishii, Two Machine Open Shop Scheduling Problem with Bi-Criteria, to appear in Discrete Applied Mathematics.

    Google Scholar 

  5. F. Ruiz-Daiz and S. French, A Survey on Multi-objective Combinatorial Scheduling, in Multi-objective Decision Making. Academic Press. London, 1983.

    Google Scholar 

  6. L. N. Van Wassenhove and K. R. Baker, A Bicriterion Approach to time/cost Trade-offs in Sequencing, European Journal of Operational Research 11 (1982) pp. 48–54.

    Article  Google Scholar 

  7. L. N. Van Wassenhove and L. F. Gelder, Solving a Bi-Criterion Scheduling Problem, European Journal of Operational Research 4 (1980) pp. 42–48.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Faculty of Enginerring, Osaka University, Suita Osaka, 565, Japan

    Hiroaki Ishii

Authors
  1. Hiroaki Ishii
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Economics, Janus Pannonius University, Rákóczi út 80, H-7621, Pécs, Hungary

    Sándor Komlósi

  2. Computer and Automation Institute, Hungary Academy of Sciences, P.O. Box 63, Kende u. 13-17, H-1518, Budapest, Hungary

    Tamás Rapcsák

  3. Graduate School of Management, University of California, 92521, Riverside, CA, USA

    Siegfried Schaible

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ishii, H. (1994). Multiobjective scheduling problems. In: Komlósi, S., Rapcsák, T., Schaible, S. (eds) Generalized Convexity. Lecture Notes in Economics and Mathematical Systems, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46802-5_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46802-5_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57624-2

  • Online ISBN: 978-3-642-46802-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation