Skip navigation

Scheduling with Time-Changing Effects and Rate-Modifying Activities

Scheduling with Time-Changing Effects and Rate-Modifying Activities

Strusevich, Vitaly and Rustogi, Kabir (2016) Scheduling with Time-Changing Effects and Rate-Modifying Activities. International Series in Operations Research & Management Science, 243 . Spinger, Switzerland. ISBN 978-3319395722

[img] PDF (Selections: Front pages, Preface, & Table of Contents)
16739 STRUSEVICH_Scheduling_with_Time-Changing_Effects_2016.pdf - Supplemental Material
Restricted to Registered users only

Download (343kB)

Abstract

In scheduling theory, the models that have attracted considerable attention during the last two decades allow the processing times to be variable, i.e., to be subjected to various effects that make the actual processing time of a job dependent on its location in a schedule. The impact of these effects includes, but is not limited to, deterioration and learning. Under the first type of effect, the later a job is scheduled, the longer its actual processing time becomes. In the case of learning, delaying a job will result in shorter processing times. Scheduling with Times-Changing Effects and Rate-Modifying Activities covers and advances the state-of-the-art research in this area.

The book focuses on single machine and parallel machine scheduling problems to minimize either the maximum completion time or the sum of completion times of all jobs, provided that the processing times are subject to various effects. Models that describe deterioration and learning effects to be considered include positional, start-time dependent, combined and cumulative, which cover most of the traditionally used models. The authors also consider more enhanced models in which the decision-maker may insert certain Rate-Modifying Activities (RMA) on processing machines, such as for example, maintenance or rest periods. In any case, the processing times of jobs are not only dependent on effects mentioned above but also on the place of a job in a schedule relative to an RMA. For most of the enhanced models described in the book, the polynomial time algorithms presented are based on similar algorithmic ideas such as reduction to linear assignment problems (in a full form or in a reduced form), discrete convexity, and controlled generation of options.

Item Type: Book
Uncontrolled Keywords: Scheduling; Changing processing times; Rate-modifying activities
Subjects: Q Science > QA Mathematics
Faculty / Department / Research Group: Faculty of Architecture, Computing & Humanities
Faculty of Architecture, Computing & Humanities > Department of Mathematical Sciences
Last Modified: 28 Apr 2018 21:31
Selected for GREAT 2016: None
Selected for GREAT 2017: GREAT b
Selected for GREAT 2018: None
Selected for GREAT 2019: None
URI: http://gala.gre.ac.uk/id/eprint/16739

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics