Answers are grounded in this paper and cite their sources.
In this paper there is considered a flexible job shop problem of operations scheduling. The new, very fast method of determination of cycle time is presented. In the design of heuristic algorithm there was the neighborhood inspired by the game of golf applied. Lower bound of the criterion function was used in the search of the neighborhood.
No takes yet. Share an insight, caveat, or question.
Bożejko et al. (2017) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: