Skip to main content

Parallel machines problems

  • Chapter
Multicriteria Scheduling

Abstract

[Mohri et al., 1999] are interested in a bicriteria scheduling problem where two machines are available to process n independent jobs that can be preempted at any (real) time. Each job J¿ is defined by a processing time p i and a due date di. Without loss of generality we assume that d 1 ≤ d 2 ... ≤ d n . The aim is to schedule the jobs in such a way that the makespan C max sind the maximum lateness L max are minimised. By considering the e constraint approach they provide a characterisation of strictly non dominated criteria vectors. This problem is solvable 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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

T’kindt, V., Billaut, JC. (2002). Parallel machines problems. In: Multicriteria Scheduling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04986-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-04986-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-04988-4

  • Online ISBN: 978-3-662-04986-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics