Abstract
Scheduling of partially ordered unit time jobs on m machines, aiming at minimal schedule length, is known as one of the notorious combinatorial optimization problems, for which the complexity status still is unresolved. Available results give polynomial time algorithms for special classes of partial orders and for the case m = 2. From a systematicial point of view, insight into the minimal (critical) posets with a certain optimal schedule length could be pivotal for finding polynomial time algorithms in general. The paper includes some comments on this approach, the complete characterization of the minimal posets in case m = 2 and some remarks on minimal posets in case m > 2.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
