OnParallel Machine Scheduling Problemwith Time Windows; 具有时间窗口约束的并行机床调度问题研究 2) parallel machine scheduling 并行机调度 1. Genetic algorithm forparallel machine schedulingwith due windows; 交货期窗口下的并行机调度问题的遗传算法
P., Zhang, X. J., & Chen, Z. B. (2014). Parallel-machine scheduling problem under the job rejection constraint. Lecture Notes in Computer Science, 8497, 158-169.W. Li, J. Li, X. Zhang and Z. Chen, Parallel-machine scheduling problem under the job rejection constraint, in ...
Kim. 2012. "Parallel machine scheduling problem with ready times, due times and sequence-dependent setup times using meta-heuristic algorithms." Engineering Optimization no. 44(9): 1021-1034.Joo, Cheol Min, and Byung Soo Kim. 2012. "Parallel Machine Scheduling Problem with Ready Times, Due ...
Parallel machine schedulingfuzzy processing timefuzzy due dateGenetic algorithmSummary: In the conventional scheduling problem, the parameters such as the processing time for each job and due dates are usually assumed to be known exactly, but in many ...
This paper asserts that the parallel machine scheduling problem has changeable job processing times,which has a convex decreasing function of resource consumption.Monma et al.think that the convex decreasing function has practical implications because it can reflect the diminishing marginal return of the...
[9] studied an identical parallel-machine scheduling problem with a rate-modifying activity. They assumed that each machine may have at most one rate-modifying activity. They showed that the time complexity of the total completion time minimization problem is O(n2m+3). Hsu et al. [2] ...
In this paper, an unrelated parallel machine scheduling problem with CPTs and machine- and sequence-dependent setup times has been studied. To solve the problem, a mixed integer programming model has been first formulated to maximize the difference between the sum of realized state of processing of...
A parallel machine scheduling problem maximizing total weighted early workSchedulingearly workcomputational complexityapproximation algorithmWe consider the total weighted early work maximization problem on identical machines in parallel such that the weights are identical, or the due date is the same. First...
A parallel machine scheduling problem in plastic production is studied in this paper. In this problem, the processing time and arrival time are uncertain but lie in their respective intervals. In addition, each job must be processed together with a mold while jobs which belong to one family can...
The satellite range scheduling problem can be regarded as a parallel machine scheduling problem, and the genetic algorithm has been well applied in parallel machine scheduling problems [30,31]. Other evolutionary algorithms such as the particle swarm algorithm and firework algorithm were also used to...