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 Philosophy and Cognitive Science II by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Literature, Music and Cosmopolitanism by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Coordination Models and Languages by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Advances in Service-Oriented and Cloud Computing by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Climate of the Romanian Carpathians by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book AETA 2015: Recent Advances in Electrical Engineering and Related Sciences by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Chicxulub: The Impact and Tsunami by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Charnley Low-Frictional Torque Arthroplasty of the Hip by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Attractors Under Discretisation by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Games and Learning Alliance by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Knowledge Engineering and Semantic Web by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Carbon Sequestration for Climate Change Mitigation and Adaptation by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Earthquakes and Their Impact on Society by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Hesitant Fuzzy Methods for Multiple Criteria Decision Analysis by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Big Data Optimization: Recent Developments and Challenges 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