OnParallel Machine Scheduling Problemwith Time Windows; 具有时间窗口约束的并行机床调度问题研究 2) parallel machine scheduling 并行机调度 1. Genetic algorithm forparallel machine schedulingwith due windows; 交货期窗口下的并行机调度问题的遗传算法
Li W, Li J ,Zhang X, et al.Parallel-machine scheduling prob- lem under the job rejection constraint[J]. Lecture Notes in Computer Science, 2014,8497 ~ 158-169.W. Li, J. Li, X. Zhang and Z. Chen, Parallel-machine scheduling problem under the job rejection constraint, in Proceedings ...
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 Scheduling Problems Considering Regular Measures of Performance and Machine Cost." Journal of the Operational Research Society 61 (5): 849-857.A.J. Ruiz-Torres, F.J. Lopez, P.J. Wojciechowski, J.C. Ho, Parallel machine scheduling problems considering regular measures of ...
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 ...
In this paper,we study parallel-machine due-date assignment problem and scheduling with linear deteriorating jobs,the actual processing time of each job is a linear function of the starting time.Each job has an independent due-date;jobs completed before or after the due-date are penalized accordi...
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...
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...
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...
Learning-Based Metaheuristic for Scheduling Unrelated Parallel Machines With Uncertain Setup Times the makespan in an Unrelated Parallel Machines Scheduling Problem (UPMSP) with uncertain machine-dependent and job sequence-dependent setu...