Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
A fatigue-conscious dual resource constrained flexible job shop scheduling problem by enhanced NSGA-II: An application from casting workshop
W Tan, X Yuan, J Wang, X Zhang - Computers & Industrial Engineering, 2021 - Elsevier
Dual resource constrained flexible job shop scheduling problem (DRCFJSP) becomes a hot
research topic in recent years. However, worker fatigue is barely considered in DRCFJSP …
research topic in recent years. However, worker fatigue is barely considered in DRCFJSP …
Shop scheduling in manufacturing environments: a review
CRH Márquez, CC Ribeiro - International Transactions in …, 2022 - Wiley Online Library
We review the literature about shop scheduling problems in manufacturing systems,
revealing the concepts and methodologies that most impact the usage of scheduling theory …
revealing the concepts and methodologies that most impact the usage of scheduling theory …
[HTML][HTML] Identifying vital edges in Chinese air route network via memetic algorithm
W Du, B Liang, G Yan, O Lordan, X Cao - Chinese Journal of Aeronautics, 2017 - Elsevier
Due to rapid development in the past decade, air transportation system has attracted
considerable research attention from diverse communities. While most of the previous …
considerable research attention from diverse communities. While most of the previous …
An efficient two-stage optimization algorithm for a flexible job shop scheduling problem with worker shift arrangement
H Li, J Peng, X Wang - Computers & Operations Research, 2024 - Elsevier
Due to the involvement of workers, scheduling production jobs necessitates consideration of
worker shifts in most production activities. In this study, we address a flexible job shop …
worker shifts in most production activities. In this study, we address a flexible job shop …
Genetic programming with local search to evolve priority rules for scheduling jobs on a machine with time-varying capacity
Priority rules combined with schedule generation schemes are a usual approach to online
scheduling. These rules are commonly designed by experts on the problem domain …
scheduling. These rules are commonly designed by experts on the problem domain …
[HTML][HTML] A mixed-integer non-linear no-wait open-shop scheduling model for minimizing makespan and total tardiness in manufacturing
M Mirmozaffari, SM Hejazi, N Karamizadeh… - Decision Analytics …, 2024 - Elsevier
Open shop scheduling problems (OSSP) are highly significant in engineering and industry,
involving critical scheduling challenges. The job type determines the duration required for …
involving critical scheduling challenges. The job type determines the duration required for …
Sustainable evaluation of environmental and occupational risks scheduling flexible job shop manufacturing systems
G Coca, OD Castrillón, S Ruiz, JM Mateo-Sanz… - Journal of Cleaner …, 2019 - Elsevier
Sustainability has become a challenge of relevant importance for organizational
management. Companies should not only achieve appropriate levels of economic efficiency …
management. Companies should not only achieve appropriate levels of economic efficiency …
Evolving priority rules for on-line scheduling of jobs on a single machine with variable capacity over time
On-line scheduling is often required in a number of real-life settings. This is the case of
distributing charging times for a large fleet of electric vehicles arriving stochastically to a …
distributing charging times for a large fleet of electric vehicles arriving stochastically to a …
NSGA families for solving a dual resource-constrained problem to optimize the total tardiness and labor productivity in the spirit of sustainability
This proposed study deals with a typical dual-objective multi-task simultaneous supervision
dual resource constrained (MTSSDRC) problem to optimize total tardiness and labor …
dual resource constrained (MTSSDRC) problem to optimize total tardiness and labor …
A hybrid local-search algorithm for robust job-shop scheduling under scenarios
B Wang, X Wang, F Lan, Q Pan - Applied Soft Computing, 2018 - Elsevier
This paper discusses an uncertain job-shop scheduling problem with the makespan as the
performance criterion. Uncertain processing times are described by discrete scenarios. A …
performance criterion. Uncertain processing times are described by discrete scenarios. A …