Dynamic worker allocation in Seru production systems with actor-critic and pointer networks
European Journal of Operational Research,
Journal Year:
2025,
Volume and Issue:
unknown
Published: Jan. 1, 2025
Language: Английский
An effective two phase heuristic for synchronized seru production scheduling and 3PL transportation problems
International Journal of Production Economics,
Journal Year:
2023,
Volume and Issue:
268, P. 109126 - 109126
Published: Dec. 7, 2023
Language: Английский
Joint decision-making for divisional seru scheduling and worker assignment considering process sequence constraints
Lili Wang,
No information about this author
Min Li,
No information about this author
Guanbin Kong
No information about this author
et al.
Annals of Operations Research,
Journal Year:
2024,
Volume and Issue:
338(2-3), P. 1157 - 1185
Published: May 22, 2024
Language: Английский
Principles on balancing divisional seru with cross-trained workers
Computers & Industrial Engineering,
Journal Year:
2024,
Volume and Issue:
200, P. 110793 - 110793
Published: Dec. 11, 2024
Language: Английский
An exact branch-and-bound algorithm for <i>seru</i> scheduling problem with sequence-dependent setup time and release date
Xiaohong Zhang,
No information about this author
Zhe Zhang,
No information about this author
Xiaoling Song
No information about this author
et al.
Journal of Industrial and Management Optimization,
Journal Year:
2023,
Volume and Issue:
20(4), P. 1662 - 1702
Published: Oct. 18, 2023
This
paper
concentrates
on
the
scheduling
problem
in
seru
production
system
(SPS),
which
is
a
new-type
advanced
with
high
manufacturing
flexibility
to
response
volatile
market.
Motivated
by
practical
scenarios,
this
considers
sequence-dependent
setup
time
and
release
date
minimize
total
weighted
tardiness.
A
mixed
integer
programming
(MIP)
model
formulated,
branch-and-bound
(B
&
B)
algorithm
combining
dominance
propositions
lower
bound
strategy
designed
subsequently.
Finally,
computational
experiments
are
conducted.
series
of
experimental
results
show
that
proposed
B
performs
very
well
finding
high-quality
solutions,
it
can
find
exact
near-exact
solutions
for
216
randomly
generated
instances
quickly.
Even
when
CPLEX
unable
solve
problems
five-hour,
return
optimal
as
many
5
serus
22
products
short
CPU
time.
Language: Английский