Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
The single-machine total tardiness scheduling problem: Review and extensions
C Koulamas - European journal of operational research, 2010 - Elsevier
We review the latest theoretical developments for the single-machine total tardiness 1//T¯
scheduling problem and propose extensions to some of them. We also review (and in some …
scheduling problem and propose extensions to some of them. We also review (and in some …
Ant colony optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
from the social behaviors of insects and of other animals. In particular, ants have inspired a …
Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
In this paper, we investigate the use of the deep learning method for solving a well-known
NP-hard single machine scheduling problem with the objective of minimizing the total …
NP-hard single machine scheduling problem with the objective of minimizing the total …
[PDF][PDF] Теория расписаний
АА Лазарев, ЕР Гафаров - Задачи и алгоритмы. М.: МГУ, 2011 - ipu.ru
Фундаментальными задачами теории расписаний для одного прибора являются
задачи с критериями минимизации суммарного запаздывания и минимизация …
задачи с критериями минимизации суммарного запаздывания и минимизация …
Distributionally robust single machine scheduling with the total tardiness criterion
This paper proposes a distributionally robust optimization (DRO) model for single machine
scheduling with uncertain processing times. The processing time of each job is assumed to …
scheduling with uncertain processing times. The processing time of each job is assumed to …
Solving the single-machine sequencing problem using integer programming
KR Baker, B Keller - Computers & Industrial Engineering, 2010 - Elsevier
Various integer programming models have been proposed for sequencing problems.
However, little is known about the practical value of these models. This paper reports a …
However, little is known about the practical value of these models. This paper reports a …
Effect of Pion Absorption on Elastic Scattering from Threshold to the Resonance Region
C Fayard, GH Lamot, T Mizutani - Physical Review Letters, 1980 - APS
The first relativistic calculation of elastic π d scattering from threshold to T π lab= 260 MeV is
presented, based upon a completely coupled set of integral equations. The effects of …
presented, based upon a completely coupled set of integral equations. The effects of …
A branch, bound, and remember algorithm for the 1|r i |∑t i scheduling problem
GK Kao, EC Sewell, SH Jacobson - Journal of Scheduling, 2009 - Springer
This paper presents a modified Branch and Bound (B&B) algorithm called, the Branch,
Bound, and Remember (BB&R) algorithm, which uses the Distributed Best First Search …
Bound, and Remember (BB&R) algorithm, which uses the Distributed Best First Search …
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
P Baptiste, J Carlier, A Jouglet - European Journal of Operational Research, 2004 - Elsevier
In this paper, we present a Branch-and-Bound procedure to minimize total tardiness on one
machine with arbitrary release dates. We introduce new lower bounds and we generalize …
machine with arbitrary release dates. We introduce new lower bounds and we generalize …
Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect
J Hu, M ** - Mathematical Programming Computation, 2024 - Springer
This paper considers a single machine identical-jobs order scheduling problem with a
position-dependent learning effect (SIOSLE) to minimize the total tardiness. A learning effect …
position-dependent learning effect (SIOSLE) to minimize the total tardiness. A learning effect …