Machine scheduling with changing processing times and rate-modifying activities
In classical scheduling models, it is normally assumed that the processing times of jobs are fixed. However, in the recent years, there has been a growing interest in models with variable processing times. Some of the common rationales provided for considering such models, is as follows: the machine...
Main Author: | Rustogi, Kabir |
---|---|
Other Authors: | Strusevich, Vitaly |
Published: |
University of Greenwich
2013
|
Subjects: | |
Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.616549 |
Similar Items
-
Connectivity properties of some transformation graphs
by: Trakultraipruk, Somkiat
Published: (2013) -
Topics in graph colouring and graph structures
by: Ferguson, David G.
Published: (2013) -
Graph powers, partitions, and other extremal problems
by: Pokrovskiy, Alexey
Published: (2013) -
Defect correction methods for computational aeroacoustics
by: Lai, Liang Simon
Published: (2013) -
Dynamic grid adaption using the LPE equation
by: Randle Bennett, Christopher
Published: (1999)