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...
Better Choices - Ensuring South Africa's…
Greg Mills, Mcebisi Jonas, … Paperback R350 R317 Discovery Miles 3 170
The State - Theories and Issues
Colin Hay, Michael Lister, … Hardcover R4,259 Discovery Miles 42 590
Making Sense of Kant's “Critique of…
Michael Pendlebury Hardcover R1,988 Discovery Miles 19 880
Celtic Knot - A Clara Swift Tale
Ann Shortell Hardcover R1,038 Discovery Miles 10 380
Escoda Modernista Tadami Synthetic Brush…
R1,258 R1,039 Discovery Miles 10 390
One-Punch Man Vol. 30
One Paperback R284 R261 Discovery Miles 2 610
Artecho 24-Piece Artist Brush Set…
R779 R529 Discovery Miles 5 290
Sylvander - Finds a Gift of True…
Rispba N McCray-Garrison Hardcover R571 Discovery Miles 5 710
A Streetcar Named Desire: York Notes for…
Hana Sambrook, Steve Eddy Paperback  (1)
R252 Discovery Miles 2 520
Combining Quantum Mechanics and…
John R. Sabin Hardcover R7,083 R5,925 Discovery Miles 59 250

 

Partners