A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times.
Bibo YangJoseph GeunesPublished in: Comput. Ind. Eng. (2007)
Keyphrases
- processing times
- scheduling problem
- resource consumption
- single machine
- flowshop
- scheduling jobs
- tardiness penalties
- single machine scheduling problem
- setup times
- number of tardy jobs
- release dates
- total weighted tardiness
- earliness tardiness
- identical parallel machines
- np hard
- makespan minimization
- sequence dependent setup times
- tardiness cost
- tabu search
- identical machines
- completion times
- worst case performance ratio
- polynomially solvable
- job shop
- release times
- job shop scheduling problem
- precedence constraints
- parallel machines
- job processing times
- competitive ratio
- scheduling decisions
- special case
- high multiplicity
- resource allocation