Interview-room Scheduling Optimization via Integer Programming

I need an Integer Programming (IP) model to optimize my candidate interview scheduling. The model should take into account both candidate and interviewer availability.

Key Tasks:
- Formulate the interview scheduling scenario as an IP model.
- Solve the model using the following methods:
1. Nearest Neighbor Heuristic
2. Cheapest Insertion Heuristic
3. Branch & Bound method (using LIFO)
- Implement a system for inputting candidate availability data via spreadsheet upload.

Skills Required:
- Expertise in Operations Research, specifically Integer Programming
- Proficient in heuristic methods
- Experience in developing scheduling models
- Familiarity with spreadsheet data integration
- Excellent understanding of scheduling constraints