Minimizing makespan for arbitrary size jobs with release times on P-batch machines with arbitrary capacities.
Zhao-Hong JiaXiaohao LiJoseph Y.-T. LeungPublished in: Future Gener. Comput. Syst. (2017)
Keyphrases
- arbitrary size
- minimizing makespan
- release times
- scheduling problem
- flowshop
- single machine
- processing times
- parallel machines
- release dates
- single machine scheduling problem
- completion times
- number of late jobs
- identical machines
- maximum tardiness
- scheduling jobs
- identical parallel machines
- sequence dependent setup times
- setup times
- texture synthesis
- learning effect
- precedence constraints
- special case
- np hard
- bicriteria
- permutation flowshop
- strongly np hard
- competitive ratio
- tabu search
- deteriorating jobs
- computational complexity
- resource consumption
- evolutionary algorithm