Approximation results for a bicriteria job scheduling problem on a single machine without preemption.
Eric AngelEvripidis BampisLaurent GourvèsPublished in: Inf. Process. Lett. (2005)
Keyphrases
- bicriteria
- single machine
- completion times
- scheduling problem
- flowshop
- processing times
- parallel machines
- maximum lateness
- total weighted tardiness
- release times
- earliness tardiness
- total tardiness
- sequence dependent setup times
- np hard
- release dates
- single machine scheduling problem
- setup times
- tabu search
- scheduling jobs
- maximum tardiness
- minimizing makespan
- competitive ratio
- production scheduling
- precedence constraints
- job processing times
- approximation algorithms
- job shop scheduling problem
- job shop
- identical parallel machines
- strongly np hard
- deteriorating jobs
- shortest processing time
- lower bound