Answers are grounded in this paper and cite their sources.
A novel constraint programming (CP) formulation that addresses the scheduling problem associated to a class of Flexible Manufacturing System (FMS) is presented. It tackles the problem in a global way by considering the tool allocation, machine assignment, routing and scheduling decisions, altogether in the formulation. Moreover, it is able to take into account a variety of objective functions. The proposed approach proved to be computationally efficient. This is shown by discussing the results of different size problems
No takes yet. Share an insight, caveat, or question.
Quiroga et al. (2006) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: