Applied Sciences,
Journal Year:
2023,
Volume and Issue:
13(9), P. 5701 - 5701
Published: May 5, 2023
Production
scheduling
in
a
knitting
workshop
is
an
important
method
to
improve
production
efficiency,
reduce
costs
and
service.
In
order
achieve
reasonable
allocation
of
parallel
machines
as
well
cooperation
between
different
within
the
workshop,
thereby
ensuring
optimal
plans,
this
paper
proposes
using
improved
genetic
algorithm
(IGA)
based
on
tabu
search.
Firstly,
model
established.
Secondly,
IGA
minimum
processing
time
rule,
priority
idle
machine
rule
ranking
code
used
optimize
solution.
Finally,
experiment
platform
for
built
verify
proposed
method.
The
experimental
results
show
that
search
performs
terms
preconvergence
speed,
global
capability
local
capability.
converges
faster
than
traditional
by
about
25%,
reduces
redundancy
scheduling,
meets
requirements
intelligent
has
good
reference
value
promoting
development
production.
International Journal of Production Research,
Journal Year:
2022,
Volume and Issue:
61(19), P. 6565 - 6588
Published: Nov. 2, 2022
Multi-variety
and
small-batch
production
mode
enables
manufacturing
industries
to
expeditiously
satisfy
customers'
personalised
demands,
where
a
large
amount
of
identical
jobs
can
be
split
into
several
sublots,
processed
by
reconfigurable
machines
with
multiple
machining
technics.
However,
such
highly
flexible
environments
bring
some
intractable
problems
the
scheduling.
Mathematical
programming
meta-heuristic
methods
become
less
efficient
when
scheduling
problem
contains
both
discrete
continuous
optimisation
attributes.
Therefore,
matheuristic,
which
combines
advantages
two
methodologies,
is
regarded
as
promising
solution.
This
paper
investigates
job
shop
lot-streaming
machine
reconfigurations
(FJSP-LSMR)
for
total
weighted
tardiness
minimisation.
First,
monolithic
mixed
integer
linear
(MILP)
model
established
FJSP-LSMR.
Afterwards,
matheuristic
method
variable
neighbourhood
search
component
(MH-VNS)
developed
address
problem.
The
MH-VNS
adopts
classical
genetic
algorithm
(GA)
framework,
introduces
MILP-based
strategies,
LSO1
LSO2,
improve
lot-sizing
plans
varying
degrees.
Four
groups
instances
are
extended
from
well-known
Fdata
benchmark
evaluate
performance
proposed
MILP
model,
LSO2
components,
MH-VNS.
Numerical
experimental
results
suggest
that
in
different
scenarios,
well
balance
solution
quality
computational
costs
reasonably
integrating
GA-
local
strategies.
In
addition,
complicated
FJSP-LSMR
case
abstracted
real-world
floor
processing
large-sized
structural
parts
further
validate
International Journal of Production Research,
Journal Year:
2023,
Volume and Issue:
62(13), P. 4793 - 4808
Published: Nov. 9, 2023
Hybrid
flow
shop
scheduling
problem
(HFSP)
with
real-life
constraints
has
been
extensively
considered;
however,
HFSP
batch
processing
machines
(BPM)
at
a
middle
stage
is
seldom
investigated.
In
this
study,
BPM
in
hot
&
cold
casting
process
considered
and
an
adaptive
artificial
bee
colony
(AABC)
proposed
to
minimise
makespan.
To
produce
high
quality
solutions,
search
employed
phase
step
implemented.
Adaptive
step,
which
may
be
onlooker
or
cooperation
empty,
decided
by
evolution
threshold.
Cooperation
performed
between
the
improved
solutions
of
one
swarm
unimproved
another
swarm.
Six
operators
are
constructed
operator
adaptively
adjusted.
A
new
scout
also
given.
lower
bound
provided
proved.
Extensive
experiments
conducted.
The
computational
results
validate
that
strategies
such
as
effective
efficient
AABC
can
obtain
better
than
methods
from
existing
literature
on
problem.
