A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs.
Eric AngelEvripidis BampisAlexander V. KononovPublished in: ESA (2001)
Keyphrases
- unrelated parallel machines
- scheduling problem
- parallel machines
- setup times
- single machine
- flowshop
- np hard
- processing times
- precedence constraints
- tabu search
- approximation algorithms
- total cost
- job shop
- job shop scheduling
- scheduling jobs
- job shop scheduling problem
- optimal solution
- production cost
- combinatorial optimization
- sequence dependent setup times
- open shop
- dynamic programming