An iterated greedy algorithm for total flow time minimization in unrelated parallel batch machines with unequal job release times.
José Elias C. ArroyoJoseph Y.-T. LeungRicardo Gonçalves TavaresPublished in: Eng. Appl. Artif. Intell. (2019)
Keyphrases
- release times
- greedy algorithm
- identical machines
- single machine
- processing times
- objective function
- scheduling problem
- dynamic programming
- scheduling jobs
- single machine scheduling problem
- greedy algorithms
- parallel machines
- release dates
- completion times
- learning effect
- maximum lateness
- setup times
- worst case
- sequence dependent setup times
- greedy strategy
- identical parallel machines
- flowshop
- batch processing
- competitive ratio
- knapsack problem
- deteriorating jobs
- information flow
- branch and bound algorithm
- parallel computing
- linear programming
- np hard
- optimal solution