Approximation algorithms for the three-machine proportionate mixed shop scheduling.
Longcheng LiuYong ChenJianming DongRandy GoebelGuohui LinYue LuoGuanqun NiBing SuAn ZhangPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- open shop
- parallel machines
- precedence constraints
- scheduling problem
- job shop
- flowshop
- np hard
- batch processing
- strongly np hard
- completion times
- special case
- sequence dependent setup times
- minimum cost
- worst case
- vertex cover
- scheduling algorithm
- approximation ratio
- parallel processors
- network design problem
- single machine
- wafer fabrication
- facility location problem
- set cover
- job shop scheduling
- resource allocation
- randomized algorithms
- constant factor
- release dates
- primal dual
- processing times
- approximation schemes
- lot sizing
- knapsack problem
- queue length
- job shop scheduling problem
- partial order
- production scheduling
- tabu search
- constant factor approximation