Abstract
A subproblem of scheduling is considered; the optimal assignment of products to equipment items, neglecting the order and sequencing of processing steps. This problem arises, if differences exist in the suitability of equipment items for processing different kinds of processing steps. The optimal compromise between capacity and suitability must be determined. Further, the influence of earliest starting time and latest completion time and the use of additional tools of limited number for optimal assignment is considered. In all cases models are proposed, which transform the problem into a capacitated network, on which a Hitchcock transportation problem has to be solved. This enables the use of standard mathematical software.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
