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 Digital Forensics and Cyber Crime by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book The Era of Private Peacemakers by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book WALCOM: Algorithms and Computation by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Nutrient Use Efficiency in Plants by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Computer Vision Analysis of Image Motion by Variational Methods by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Human-Robot Interaction Strategies for Walker-Assisted Locomotion by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Major Crops and Water Scarcity in Egypt by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Microbiome Community Ecology by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Experimental and Applied Mechanics, Volume 4 by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Lectures on Classical and Quantum Theory of Fields by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Computational Vision and Bio Inspired Computing by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Computational Diffusion MRI by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book PET/CT in Hepatobiliary and Pancreatic Malignancies by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Teaching Education for Sustainable Development at University Level by Kabir Rustogi, Vitaly A. Strusevich
Cover of the book Realtime Data Mining 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