Makespan optimization in a single-machine scheduling problem with dynamic job ready times - Complexity and algorithms.
Mateusz GorczycaAdam JaniakWladyslaw A. JaniakMarcin DymanskiPublished in: Discret. Appl. Math. (2015)
Keyphrases
- single machine scheduling problem
- release dates
- processing times
- combinatorial optimization
- optimization problems
- single machine
- maximum tardiness
- worst case
- scheduling problem
- computational complexity
- completion times
- sequence dependent setup times
- branch and bound algorithm
- flowshop
- space complexity
- query optimization
- computational efficiency
- special case
- search algorithm
- scheduling jobs
- genetic algorithm