Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Heuristic and metaheuristic methods for the parallel unrelated machines scheduling problem: a survey
Scheduling has an immense effect on various areas of human lives, be it though its
application in manufacturing and production industry, transportation, workforce allocation, or …
application in manufacturing and production industry, transportation, workforce allocation, or …
Unrelated parallel machine scheduling with multiple time windows: An application to earth observation satellite scheduling
J Wang, G Song, Z Liang, E Demeulemeester… - Computers & Operations …, 2023 - Elsevier
In this paper, we investigate a variant of the unrelated parallel machine scheduling problem
with multiple time windows that is widely employed in the scheduling of earth observation …
with multiple time windows that is widely employed in the scheduling of earth observation …
Hybrid genetic algorithms with dispatching rules for unrelated parallel machine scheduling with setup time and production availability
CM Joo, BS Kim - Computers & Industrial Engineering, 2015 - Elsevier
This article considers the unrelated parallel machine scheduling problem with sequence-
and machine-dependent setup times and machine-dependent processing times …
and machine-dependent setup times and machine-dependent processing times …
Scheduling unrelated machines by randomized rounding
We present a new class of randomized approximation algorithms for unrelated parallel
machine scheduling problems with the average weighted completion time objective. The key …
machine scheduling problems with the average weighted completion time objective. The key …
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
This research compares the performance of various heuristics and one metaheuristic for
unrelated parallel machine scheduling problems. The objective functions to be minimized …
unrelated parallel machine scheduling problems. The objective functions to be minimized …
A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
This paper considers unrelated parallel machine scheduling involving machine usage costs,
in addition to classic job completion time-related costs. The usage cost of each machine is …
in addition to classic job completion time-related costs. The usage cost of each machine is …
An effective heuristic based on 3-opt strategy for seru scheduling problems with learning effect
This paper is concerned with the scheduling problem in a new-type seru production system
by consideration of DeJong's learning effect to minimise the total weighted completion time …
by consideration of DeJong's learning effect to minimise the total weighted completion time …
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
In this work, we tackle the problem of scheduling a set of jobs on a set of unrelated parallel
machines with minimising the total weighted completion times as performance criteria. The …
machines with minimising the total weighted completion times as performance criteria. The …
Effective heuristic for large-scale unrelated parallel machines scheduling problems
This paper is concerned with non-preemptive scheduling of large-scale unrelated parallel
machines (UPM) with the objective of minimizing total weighted completion times (TWCT) …
machines (UPM) with the objective of minimizing total weighted completion times (TWCT) …
[HTML][HTML] Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms
K Li, S Yang - Applied mathematical modelling, 2009 - Elsevier
We consider a class of non-identical parallel-machine scheduling problems in which the
goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and …
goal is to minimize total (or mean) weighted (or unweighted) completion time. Models and …