Abstract
This paper considers the semi-on-line versions of scheduling problem P2|| C max. We study the semi-on-line problems with combination of two types of information. Five basic types of partial information are considered. For two kinds of pairwise combination, we present their respective optimal semi-on-line algorithms which show that combination can admit to construct better algorithms.
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.
