Login / Signup

Discrete and continuous-time formulations for dealing with break periods: Preemptive and non-preemptive scheduling.

Pedro M. CastroIiro HarjunkoskiIgnacio E. Grossmann
Published in: Eur. J. Oper. Res. (2019)
Keyphrases
  • preemptive scheduling
  • markov processes
  • single machine to minimize
  • scheduling problem
  • markov chain
  • single machine
  • discrete geometry
  • discrete version
  • optimization methods
  • optimal control
  • markov process