The two-machine no-wait general and proportionate open shop makespan problem.

S. S. Panwalkar Christos Koulamas

Published in: Eur. J. Oper. Res. (2014)

Keyphrases

open shop
job shop
flowshop
approximation algorithms
special case
scheduling problem
multistage
polynomially solvable
parallel machines
completion times
unrelated parallel machines
flowshop scheduling
network flow
processing times
np hard
job shop scheduling
single machine
tabu search