On Several Scheduling Problems with Rejection or Discretely Compressible Processing Times.
Zhigang CaoZhen WangYuzhong ZhangShoupeng LiuPublished in: TAMC (2006)
Keyphrases
- processing times
- scheduling problem
- single machine
- flowshop
- setup times
- scheduling jobs
- release dates
- polynomially solvable
- total weighted tardiness
- single machine scheduling problem
- np hard
- tabu search
- makespan minimization
- job shop
- resource consumption
- worst case performance ratio
- job shop scheduling
- precedence relations
- earliness tardiness
- completion times
- precedence constraints
- release times
- high multiplicity
- lower bound
- identical machines
- competitive ratio
- dynamic programming
- special case