A scheduling problem for two competing queues with finite capacity and non-negligible setup times.

Massimo Del Gaudio Francesco Martinelli Paolo Valigi

Published in: CDC (2001)

Keyphrases

finite capacity
setup times
scheduling problem
single machine
flowshop
queueing model
processing times
single product
precedence constraints
single server
lot sizing
np hard
parallel machines
tabu search
multi item
lagrangian relaxation
setup cost
single machine scheduling problem
queueing networks
decision making