Login / Signup

An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem.

Amir ElaloufEugene LevnerHuajun Tang
Published in: J. Sched. (2013)
Keyphrases
  • computational complexity
  • scheduling problem
  • data sets
  • processing times
  • search algorithm
  • maximum number
  • real time
  • multiscale
  • information technology
  • memory requirements
  • fixed number