Formulating a Scheduling Problem with Almost Identical Jobs by Using Positional Completion Times.
Han HoogeveenSteef L. van de VeldePublished in: IPCO (1995)
Keyphrases
- completion times
- scheduling problem
- single machine
- flowshop
- sum of completion times
- processing times
- open shop
- release times
- single machine scheduling problem
- absolute deviation
- unrelated parallel machines
- weighted sum
- setup times
- tabu search
- precedence constraints
- permutation flowshop
- np hard
- identical parallel machines
- competitive ratio
- job shop scheduling problem
- total tardiness
- release dates
- sequence dependent setup times
- parallel machines
- minimizing makespan
- number of late jobs
- maximum lateness
- identical machines
- resource consumption