Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents.
Baruch MorGur MosheiovPublished in: J. Oper. Res. Soc. (2014)
Keyphrases
- scheduling problem
- flowshop
- special case
- open shop
- processing times
- np hard
- single machine
- setup times
- minimizing makespan
- total tardiness
- flowshop scheduling
- bicriteria
- maximum lateness
- makespan minimization
- parallel machines
- job shop
- minimizing total tardiness
- approximation algorithms
- sequence dependent setup times
- total flowtime
- tabu search
- total weighted tardiness
- polynomially solvable
- job shop scheduling
- strongly np hard
- benchmark problems
- permutation flowshop
- resource allocation
- precedence constraints
- preventive maintenance
- optimal solution
- maximum tardiness
- flowshop scheduling problems
- identical parallel machines
- linear programming
- feasible solution
- job shop scheduling problem