Bounding Strategies for the Parallel Processors Scheduling Problem With No-Idle Time Constraint, Release Date, and Delivery Time.
Lotfi HidriAli M. Al-SamhanMohammed M. MabkhotPublished in: IEEE Access (2019)
Keyphrases
- scheduling problem
- precedence constraints
- parallel processors
- single machine
- single machine scheduling problem
- np hard
- single processor
- contract algorithms
- flowshop
- processing times
- tabu search
- parallel machines
- minimizing makespan
- upper bound
- global constraints
- information retrieval
- tardiness cost
- orders of magnitude
- genetic algorithm
- np complete
- min cost
- data streams
- reinforcement learning