A heuristic for emergency operations scheduling with lead times and tardiness penalties
We model an emergency operations scheduling problem with tardiness penalties. The lead times (waiting, production and transportation times) are considered. Through a structure analysis of the problem, solvable cases are identified. A heuristic algorithm based on a mixed integer programming is developed. The algorithm runs very fast and has small errors in numerical experiment.
heuristics scheduling mixed integer programming supply chain management