Skip to main content
Fig. 1 | SpringerPlus

Fig. 1

From: Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date

Fig. 1

Late work definition schematic diagram. In this figure, d is the common due date, \({{p}_{j}}\) denotes the processing time of each job \({{J}_{j}}\ (j=1,2,\ldots ,n)\), and \({{C}_{j}}\) denotes the completion time of job \({{J}_{j}}\), then the late work \({{Y}_{j}}\) for this job is the minimum of \({{p}_{j}}\) and \(max\{0,{C}_{j}-d\}\)

Back to article page