0
Your cart

Your cart is empty

Browse All Departments
  • All Departments
Price
  • R2,500 - R5,000 (2)
  • -
Status
Brand

Showing 1 - 2 of 2 matches in All Departments

Scheduling with Time-Changing Effects and Rate-Modifying Activities (Hardcover, 1st ed. 2017): Vitaly A. Strusevich, Kabir... Scheduling with Time-Changing Effects and Rate-Modifying Activities (Hardcover, 1st ed. 2017)
Vitaly A. Strusevich, Kabir Rustogi
R4,394 R3,824 Discovery Miles 38 240 Save R570 (13%) Ships in 12 - 19 working days

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.

Scheduling with Time-Changing Effects and Rate-Modifying Activities (Paperback, Softcover reprint of the original 1st ed.... Scheduling with Time-Changing Effects and Rate-Modifying Activities (Paperback, Softcover reprint of the original 1st ed. 2017)
Vitaly A. Strusevich, Kabir Rustogi
R4,211 Discovery Miles 42 110 Ships in 10 - 15 working days

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.

Free Delivery
Pinterest Twitter Facebook Google+
You may like...
Bioenergy Engineering - Fundamentals…
Krushna Prasad Shadangi, Prakash Kumar Sarangi, … Paperback R4,976 Discovery Miles 49 760
Fighting For The Dream
R.W. Johnson Paperback  (3)
R583 Discovery Miles 5 830
Trauma-Informed Practices for Early…
Julie Nicholson, Julie Kurtz, … Hardcover R4,166 Discovery Miles 41 660
The Sleepy Dinosaurs - Bedtime Stories…
Hannah Watson Hardcover R501 Discovery Miles 5 010
Precarious Power - Compliance And…
Susan Booysen Paperback  (4)
R380 R351 Discovery Miles 3 510
Autism Friendly Business - Serving…
Jennifer Percival Paperback R1,188 Discovery Miles 11 880
Stellenbosch: Murder Town - Two Decades…
Julian Jansen Paperback R360 R337 Discovery Miles 3 370
What Works in Reducing Inequalities in…
Helen Roberts Book R2,936 Discovery Miles 29 360
Fire and Sword in Shansi - the Story of…
E.H. Edwards Paperback R602 Discovery Miles 6 020
Algae Based Bioelectrochemical Systems…
Durga Madhab Mahapatra, Lakhveer Singh, … Paperback R3,725 Discovery Miles 37 250

 

Partners