Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[HTML][HTML] Four decades of research on the open-shop scheduling problem to minimize the makespan
One of the basic scheduling problems, the open-shop scheduling problem has a broad
range of applications across different sectors. The problem concerns scheduling a set of …
range of applications across different sectors. The problem concerns scheduling a set of …
[HTML][HTML] Scheduling in manufacturing with transportation: Classification and solution techniques
Many modern manufacturing settings feature especially close relationship of the
transportation of workpieces between production steps with the scheduling of manufacturing …
transportation of workpieces between production steps with the scheduling of manufacturing …
A genetic algorithm for scheduling open shops with sequence-dependent setup times
In the open shop scheduling problem with sequence-dependent setup times, there is no
established order for the processing of the jobs, which leads to a large number of possible …
established order for the processing of the jobs, which leads to a large number of possible …
A new efficient biased random key genetic algorithm for open shop scheduling with routing by capacitated single vehicle and makespan minimization
Over the last years, researchers have been paying particular attention to scheduling
problems integrating production environments and distribution systems to adopt more …
problems integrating production environments and distribution systems to adopt more …
A novel hybrid simulated annealing for no-wait open-shop surgical case scheduling problems
In this paper, the problem of finding an assignment of “n” surgeries to be presented in one of
“m” identical operating rooms (ORs) or machines as the surgical case scheduling problem …
“m” identical operating rooms (ORs) or machines as the surgical case scheduling problem …
A new hybridization of adaptive large neighborhood search with constraint programming for open shop scheduling with sequence-dependent setup times
In recent years, researchers have been paying special attention to scheduling problems with
setup times and costs, aiming to adopt more realistic assumptions. This paper aims at …
setup times and costs, aiming to adopt more realistic assumptions. This paper aims at …
[HTML][HTML] Multi-objective open shop scheduling by considering human error and preventive maintenance
This study presents an open shop scheduling model by considering human error and
preventive maintenance. The proposed mathematical model takes into account conflicting …
preventive maintenance. The proposed mathematical model takes into account conflicting …
[HTML][HTML] Literature review of open shop scheduling problems
This paper discusses review of literature of open shop scheduling problems. First, the
problem is classified as per different measures of performance, viz., minimization of …
problem is classified as per different measures of performance, viz., minimization of …
New efficient heuristics for scheduling open shops with makespan minimization
This paper deals with the so-called Open Shop Scheduling Problem (OSSP) with makespan
objective, which consists of scheduling a set of jobs that must visit a set of machines in no …
objective, which consists of scheduling a set of jobs that must visit a set of machines in no …
A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
In this paper, we study Open Shop Scheduling Problems (OSSPs) that involve (1) travel
times between machines and/or (2) sequence-dependent setup times. First, we propose a …
times between machines and/or (2) sequence-dependent setup times. First, we propose a …