A greedy heuristic for the mean tardiness sequencing problem.
Adam FadlallaJames R. EvansMartin S. LevyPublished in: Comput. Oper. Res. (1994)
Keyphrases
- greedy heuristic
- np hard
- greedy algorithm
- scheduling problem
- single machine
- single machine scheduling problem
- processing times
- knapsack problem
- single machine scheduling
- minimum weight
- lower bound
- set cover
- optimal solution
- flowshop
- parallel machines
- worst case analysis
- minimize total
- scheduling jobs
- artificial intelligence
- tandem mass spectrometry
- metaheuristic
- dynamic programming
- search algorithm
- objective function