Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance.
Baruch MorGur MosheiovPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- min sum
- scheduling problem
- flowshop
- np hard
- open shop
- job shop
- preventive maintenance
- maximum lateness
- setup times
- processing times
- sequence dependent setup times
- single machine
- lower bound
- parallel machines
- special case
- approximation algorithms
- minimizing makespan
- bicriteria
- precedence constraints
- tabu search
- flowshop scheduling
- completion times
- minimum cost
- integer programming
- linear programming
- optimal solution
- job processing times
- goal programming
- knapsack problem
- worst case
- computational complexity
- flowshop scheduling problems
- identical parallel machines
- strongly np hard
- release dates
- lagrangian relaxation
- job shop scheduling problem
- multiple objectives
- linear program