Scheduling start time dependent jobs to minimize the total weighted completion time.
Aleksander BachmanT. C. Edwin ChengAdam JaniakC. T. Daniel NgPublished in: J. Oper. Res. Soc. (2002)
Keyphrases
- minimize total
- scheduling problem
- processing times
- single machine
- flowshop
- release dates
- weighted tardiness
- identical machines
- identical parallel machines
- parallel machines
- release times
- maximum lateness
- scheduling jobs
- total cost
- sequence dependent setup times
- setup times
- single machine scheduling problem
- unrelated parallel machines
- precedence relations
- job processing times
- job scheduling
- batch processing machines
- job shop
- np hard
- competitive ratio
- optimal scheduling
- precedence constraints
- resource consumption
- job shop scheduling problem
- misclassification costs
- production scheduling
- strongly np hard
- travel time
- completion times
- scheduling policies