Parameterized complexity of machine scheduling: 15 open problems
M Mnich, R Van Bevern - Computers & Operations Research, 2018 - Elsevier
Abstract Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are fixed …
complexity research. A novel approach to machine scheduling problems are fixed …
Heuristic scheduling of batch production processes based on petri nets and iterated greedy algorithms
Wire rod and bar rolling is an important batch production process in steel production
systems. A scheduling problem originated from this process is studied in this work by …
systems. A scheduling problem originated from this process is studied in this work by …
[图书][B] Scheduling
ML Pinedo - 2012 - Springer
Michael L. Pinedo Theory, Algorithms, and Systems Sixth Edition Page 1 Scheduling Michael L.
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
Pinedo Theory, Algorithms, and Systems Sixth Edition Page 2 Scheduling Page 3 Michael L …
[HTML][HTML] Single-machine scheduling with release times, deadlines, setup times, and rejection
M de Weerdt, R Baart, L He - European Journal of Operational Research, 2021 - Elsevier
Single-machine scheduling where jobs have a penalty for being late or for being rejected
altogether is an important (sub) problem in manufacturing, logistics, and satellite scheduling …
altogether is an important (sub) problem in manufacturing, logistics, and satellite scheduling …
Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
As commonly observed in practice, firms can accelerate job processing by adding additional
resources to the manufacturing system while striving to sustain on-time delivery. In this …
resources to the manufacturing system while striving to sustain on-time delivery. In this …
Minimizing number of tardy jobs in flow shop scheduling using a hybrid whale optimization algorithm
DM Utama - Journal of Physics: Conference Series, 2021 - iopscience.iop.org
Abstract The number of Tardy Jobs is a critical performance in scheduling because it can
increase customer trust in the company. If the number of tardy jobs is large, trust in the …
increase customer trust in the company. If the number of tardy jobs is large, trust in the …
Reducing tardy batches by seru production: Model, exact solution, cooperative coevolution solution, and insights
X Li, Y Yu, W Sun, J Tang - Computers & Operations Research, 2023 - Elsevier
Seru production, as an innovative production mode, has the advantages of quick response,
good flexibility, and high efficiency. We investigate how to reduce tardy batches using seru …
good flexibility, and high efficiency. We investigate how to reduce tardy batches using seru …
The due date assignment scheduling problem with delivery times and truncated sum-of-processing-times-based learning effect
J Qian, Y Zhan - Mathematics, 2021 - mdpi.com
This paper considers a single-machine scheduling problem with past-sequence-dependent
delivery times and the truncated sum-of-processing-times-based learning effect. The goal is …
delivery times and the truncated sum-of-processing-times-based learning effect. The goal is …
Preemptive scheduling to minimize total weighted late work and weighted number of tardy jobs
R Chen, R He, J Yuan - Computers & Industrial Engineering, 2022 - Elsevier
In this paper, we consider the single-machine bi-criteria preemptive scheduling for
minimizing the total weighted late work and the weighted number of tardy jobs, where …
minimizing the total weighted late work and the weighted number of tardy jobs, where …
On the parameterized tractability of single machine scheduling with rejection
In this paper we study a single machine scheduling problem with rejection. In such a
scheduling problem, the scheduler can reject to process a job in the shop at a certain cost …
scheduling problem, the scheduler can reject to process a job in the shop at a certain cost …