[CITATION][C] Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
WH Kuo, DL Yang - Information Processing Letters, 2006 - Elsevier
In traditional scheduling problems, most literature assumes that the processing time of a job
is fixed. However, there are many situations where the processing time of a job depends on
the starting time or the position of the job in a sequence. In such situations, the actual
processing time of a job may be more or less than its normal processing time if it is
scheduled later. For example, in steel production, a delay in tackling an ingot may result in
an increasing processing time of the ingot rolling procedure. In agriculture, harvesting may …
is fixed. However, there are many situations where the processing time of a job depends on
the starting time or the position of the job in a sequence. In such situations, the actual
processing time of a job may be more or less than its normal processing time if it is
scheduled later. For example, in steel production, a delay in tackling an ingot may result in
an increasing processing time of the ingot rolling procedure. In agriculture, harvesting may …
Showing the best result for this search. See all results