Scheduling with Time-Changing Effects and Rate-Modifying Activities

Business & Finance, Management & Leadership, Operations Research, Production & Operations Management
Cover of the book Scheduling with Time-Changing Effects and Rate-Modifying Activities by Kabir Rustogi, Vitaly A. Strusevich, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Kabir Rustogi, Vitaly A. Strusevich ISBN: 9783319395746
Publisher: Springer International Publishing Publication: October 18, 2016
Imprint: Springer Language: English
Author: Kabir Rustogi, Vitaly A. Strusevich
ISBN: 9783319395746
Publisher: Springer International Publishing
Publication: October 18, 2016
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book High-Performance AD and DA Converters, IC Design in Scaled Technologies, and Time-Domain Signal Processing by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Swarm Robotics: A Formal Approach by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Advances in Design for Inclusion by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book The Gamification of Citizens' Participation in Policymaking by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Cosmological and Black Hole Apparent Horizons by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Homological and Computational Methods in Commutative Algebra by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Emotions and Reflexivity in Health & Social Care Field Research by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Grid Generation Methods by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Vasculitis in Clinical Practice by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Differential Rotation in Sun-like Stars from Surface Variability and Asteroseismology by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Optical Fiber Sensors for loT and Smart Devices by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Contemporary Trends and Challenges in Finance by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Multimedia Forensics and Security by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Practical LaTeX by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Information Systems and Neuroscience by Kabir Rustogi, Vitaly A. Strusevich
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy