Processes with alternating activities
The author examines the following class of short-term planning problems: given is a planning period T, with n time intervals, m subprocesses, each subprocess i consisting of alternating \(\nu_ i\) dominant and nondominant activities and \(F_ j\) relationships, defined for the dominant activities, linking different subprocesses; it is required to schedule the dominant activities over the time intervals j of the period T so as to achieve the target values \(\nu_ i\) \((i=1,...,m)\) and \(F_ j\) \((j=1,...,n)\) to ensure that the subprocesses maintain their character to the maximum possible degree and to obtain the best solution in the sense of some criterion.
This page was built for publication: Processes with alternating activities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108186)
