In this thesis, we focus on solving multiobjective optimization problems; both from practical and theoretical perspectives. We have design new SLS tool for solving multiobjective problems.
From theoretical perspective, we looked at designing efficient online algorithms for scheduling problems. Our goal is to schedule streaming jobs non preemptively such that each job receives "fair" amount of service. Note that these problems are NP-hard in preemptive setting. We have designed non trivial algorithms which improve upon the previous results.