New lower bounds for solving a scheduling problem with resource collaboration.
Inessa AinbinderGabriel David PintoGad RabinowitzPublished in: Comput. Ind. Eng. (2019)
Keyphrases
- scheduling problem
- lower bound
- np hard
- strongly np hard
- upper bound
- search algorithm for solving
- single machine
- tabu search
- objective function
- resource sharing
- flowshop
- branch and bound algorithm
- minimizing makespan
- setup times
- precedence constraints
- permutation flowshop
- exact solution
- branch and bound
- worst case
- lower and upper bounds
- collaborative learning
- grid infrastructure
- computational complexity
- data structure
- resource management
- processing times
- greedy algorithm
- combinatorial optimization
- linear programming
- knowledge management