IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-39574-6_5.html
   My bibliography  Save this book chapter

Convex Sequences and Combinatorial Counting

In: Scheduling with Time-Changing Effects and Rate-Modifying Activities

Author

Listed:
  • Vitaly A. Strusevich

    (University of Greenwich)

  • Kabir Rustogi

    (University of Greenwich
    Delhivery Logistics Pvt. Ltd.)

Abstract

In this chapter, we establish certain properties that are used on several occasions in this book. The main results that we present here primarily revolve around the convex and V-shaped finite sequences and the inequalities that govern them. We prove an inequality that involves an arbitrary non-decreasing function that depends on ceiling functions, thereby establishing the convexity and V-shapeness of the corresponding sequence. This sequence often appears in scheduling problems, especially when the jobs of a given set are to be divided into a known number of groups. The V-shapeness of this sequence enables us to speed up the running times of several algorithms that we consider in this book (see, e.g., Chaps. 16 and 17 ).

Suggested Citation

  • Vitaly A. Strusevich & Kabir Rustogi, 2017. "Convex Sequences and Combinatorial Counting," International Series in Operations Research & Management Science, in: Scheduling with Time-Changing Effects and Rate-Modifying Activities, chapter 0, pages 91-102, Springer.
  • Handle: RePEc:spr:isochp:978-3-319-39574-6_5
    DOI: 10.1007/978-3-319-39574-6_5
    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 search 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:isochp:978-3-319-39574-6_5. 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.