Login / Signup
Two-machine flow shop and open shop scheduling problems with a single maintenance window.
Gur Mosheiov
Assaf Sarig
Vitaly A. Strusevich
Jonathan Mosheiff
Published in:
Eur. J. Oper. Res. (2018)
Keyphrases
</>
scheduling problem
job shop
open shop
flowshop
processing times
parallel machines
job shop scheduling
np hard
single machine
completion times
job shop scheduling problem
precedence constraints
tabu search
neural network
production scheduling
linear programming
resource constrained
polynomially solvable
special case