IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-00142-0_20.html
   My bibliography  Save this book chapter

On Single Machine Scheduling and Due DateAssignment with Positionally Dependent Processing Times

In: Operations Research Proceedings 2008

Author

Listed:
  • Valery S. Gordon

    (National Academy of Sciences of Belarus, United Institute of Informatics Problems)

  • Vitaly A. Strusevich

    (University of Greenwich, School of Computing and Mathematical Sciences)

Abstract

Summary This paper addresses single machine scheduling problems in which the decision-maker controls two parameters: the due dates of the jobs and the processing times. In the problems under consideration, the jobs have to be assigned the due dates and the objective includes the cost of such an assignment, the total cost of discarded jobs and, possibly, the holding cost of the early jobs represented in the form of total earliness. The processing times of the jobs are not constant but depend on the position of a job in a schedule. We mainly focus on scheduling models with a deterioration effect. Informally, under deterioration the processing time is not a constant but changes according to some rule, so that the later a job starts, the longer it takes to process. An alternative type of scheduling models with non-constant processing times are models with a learning effect, in which the later a job starts, the shorter its processing time is. The two types of models are close but not entirely symmetric.

Suggested Citation

  • Valery S. Gordon & Vitaly A. Strusevich, 2009. "On Single Machine Scheduling and Due DateAssignment with Positionally Dependent Processing Times," Springer Books, in: Bernhard Fleischmann & Karl-Heinz Borgwardt & Robert Klein & Axel Tuma (ed.), Operations Research Proceedings 2008, chapter 20, pages 123-128, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-00142-0_20
    DOI: 10.1007/978-3-642-00142-0_20
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-00142-0_20. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.