Зарегистрироваться
Восстановить пароль
FAQ по входу

Strusevich V.A., Rustogi K. Scheduling with Time-Changing Effects and Rate-Modifying Activities

  • Файл формата pdf
  • размером 4,43 МБ
  • Добавлен пользователем
  • Отредактирован
Strusevich V.A., Rustogi K. Scheduling with Time-Changing Effects and Rate-Modifying Activities
Springer, 2017. — 460 p. — (International Series in Operations Research & Management Science 243). — ISBN 978-3-319-39572-2, 978-3-319-39574-6.
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 Time-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, learning and general non-monotone effects to be considered include positional, start-time dependent, cumulative and their combinations, 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, polynomial-time algorithms are presented which 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.
Contents:
Models and Concepts of Classical Scheduling
Pairwise Interchange Argument and Priority Rules
Sequencing Under Precedence Constraints
Relevant Boolean Programming Problems
Convex Sequences and Combinatorial Counting
Introduction to Time-Changing Effects
Scheduling with Positional Effects
Scheduling with Pure and Combined Additive Start-Time-Dependent Effects
Scheduling with Pure and Combined Multiplicative Start-Time-Dependent Effects
Scheduling with Pure and Combined Cumulative Effects
Scheduling on Parallel Machines with Various Effects
General Framework for Studying Models with Rate-Modifying Activities
Scheduling with Fixed Compulsory Maintenance Periods
Scheduling with Flexible Maintenance
Scheduling with Rate-Modifying Activities
Scheduling with Maintenance and Positional Effects
Scheduling with Maintenance and Start-Time-Dependent Effects
Scheduling with Rate-Modifying Activities and Enhanced Effects
Scheduling with Maintenance and Linear Cumulative Effects
Scheduling with Rate-Modifying Activities on Parallel Machines Under Various Effects
  • Чтобы скачать этот файл зарегистрируйтесь и/или войдите на сайт используя форму сверху.
  • Регистрация