Abstract
The progress of computer architecture has increased the necessity to design efficient scheduling algorithms according to the types of computer systems. We survey recent results of optimization and approximation algorithms for deterministic models of computer scheduling. We deal with identical, uniform and unrelated parallel processor systems, and flowshop systems. Optimality criteria considered in this paper are schedule-length and mean (weighted) flow-time. These are important measures for evaluating schedules in computer systems. Results on practical algorithms such as list scheduling are emphasized.
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
