Scheduling preemptable position-dependent jobs on two parallel identical machines.

Marcin Zurowski Stanislaw Gawiejnowicz

Published in: Comput. Ind. Eng. (2019)

Keyphrases

identical machines
processing times
job scheduling
scheduling problem
single machine
scheduling jobs
setup times
precedence constraints
release dates
flowshop
single machine scheduling problem
identical parallel machines
polynomial time approximation
np hard
branch and bound algorithm