NP-Hardness and Approximation Bounds for Scheduling Problems - Electrical and Computer Engineering

We are looking for self-motivated undergraduate students to work on NP-Hardness and Approximation Bound proof for some classical Real-Time Scheduling Problems.
According to, UCF ranks top 15th in real-time and embedded systems domain nationally, while all research in this area at UCF is done at the RTIS lab under the direction of Prof. Zhishan Guo.

Project Dates

Start Date: 1/11/2021 - End Date: 4/28/2021

Students Needed

Type of Project


Student Responsibilities

You are expected to dedicate about 10 hours of work per week for at least a year. You are expected to work remotely and meet via Zoom.

Time Commitment

10 hours per week hour(s)

Student Requirements

Minimum requirements: Computer Science/ Math/ Physics/ ECE major with GPA 3.5+. Excellent logic thinking and math/computer science theory proof ability.

Preferred requirements: All-A or A- in math and theory-focused courses. Basic knowledge of NP-Hardness, NP-Hardness proof, approximation bounds, and/or real-time scheduling theory

Interested in Working With the Following Programs

For EXCEL URE Students Only

Additional Notes

No payment. Yet we support student’s travel (world-wide) to top conferences (like RTSS, ECRTS, CPS Week, ES Week, etc.) to present research outcomes.

Position Overview

  • Date Posted: 09-28-2018
  • Location:
    • Orlando (Main Campus)
  • Paid: No