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 ...
2012. "Parallel Machine Scheduling Problem with Ready Times, Due Times and Sequence-Dependent Setup Times Using Meta-Heuristic Algorithms." Engineering Optimization 44 (9): 1021-1034.Joo, C.M., and B.S. Kim. 2012. "Parallel machine scheduling problem with ready times, due times and sequence...
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...
parallel machine flexible resource scheduling problemUPMFRS problemNP hardSummary: In this paper, we examine the parallel-machine flexible-resource scheduling problem in which job assignment to machines are not specified (UPMFRS). The UPMFRS problem is $NP$-hard, motivating the development of ...
On Parallel Machine Scheduling Problem with Time Windows; 具有时间窗口约束的并行机床调度问题研究 2) parallel machine scheduling 并行机调度 1. Genetic algorithm for parallel machine scheduling with due windows; 交货期窗口下的并行机调度问题的遗传算法 更多例句>> 3) multiprocessor scheduling problem ...
This paper investigates an unrelated parallel machine scheduling problem with a restrictive common due date. The objective is to minimize the total sum of earliness/tardiness costs. Using some properties of the problem such as V-Shaped property, optimizing start times of machines, and no idle time...
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 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 particularity in the identical parallel machines scheduling case is that the processing time for each job j is the same for all machines. A more general case is the uniform parallel machines scheduling problem. Here, the processing time of a job j depends on the machine i, i∈M to ...
[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] ...