Daily Schedule Basic problems involve arranging daily activities or tasks in chronological order based on given time slots. You need to sequence events from earliest to latest, testing your ability to compare and order time-based information.

Weekly Class Schedule problems involve arranging subjects or activities across days of the week (Monday to Friday) with constraints like fixed day assignments, consecutive placements, and specific gaps between subjects.

Meeting Slot Optimization problems involve finding time slots when multiple people are available for a meeting. You need to identify common available times from individual availability lists using set intersection principles.

Exam Schedule with Prep Time problems involve scheduling exams with specific preparation day requirements. Each exam needs a certain number of preparation days before it, and you must find the optimal schedule within available days.

Project Task Dependency problems involve scheduling tasks that have dependencies (some tasks must finish before others can start). You need to find the minimum project completion time using Critical Path Method (CPM) by calculating earliest start and finish times.

Shift Rotation Schedule problems involve assigning employees to different work shifts (morning, evening, night) across multiple days with constraints like no same shift on consecutive days, fixed assignments, and exclusions.

Month-Date Scheduling problems involve arranging events or persons across specific months and dates (e.g., 5th and 15th of each month). Constraints include same-month requirements, fixed months, and position gaps.

Transportation Schedule problems involve finding the optimal route from origin to destination using multiple transport options with departure and arrival times. You must ensure minimum connection times between transfers and find the earliest arrival.

Priority-Deadline Scheduling problems involve ordering tasks based on priority levels and deadlines. Higher priority tasks are scheduled first, and among equal priority, earlier deadlines take precedence.

Conference Session Scheduling problems involve arranging multiple sessions across time slots and rooms with constraints like speaker availability, room preferences, session conflicts, and consecutive requirements.

Production Line Scheduling problems involve sequencing production batches of different products with setup times between different product types. The goal is to minimize total production time by batching identical products together.

Appointment Booking Conflicts problems involve assigning patients to doctors and time slots while respecting that each doctor can see only one patient per time slot. You must determine if all appointments can be accommodated without conflicts.

Resource-Constrained Scheduling problems involve scheduling tasks that require specific amounts of a limited resource. Multiple tasks can run in parallel as long as total resource demand doesn't exceed available capacity.

Temporal Ordering Linear problems involve arranging items (tasks, people, events) in a linear sequence from first to last with constraints like 'X is immediately before Y', 'X is before Y', 'exactly n items between X and Y', and positional exclusions.

Time Slot Minimum Gap problems involve scheduling events that must have a minimum time gap between them (e.g., two hours between the end of one event and the start of another). You need to find the earliest possible time for the second event.

Dynamic Transportation Optimization problems involve finding the fastest journey from origin to destination using multiple transport options (flights, trains) with layover constraints. You must consider all possible combinations of connecting services.

Dynamic Multi-Person Deduction problems involve assigning people to tasks or roles with multiple constraints. You must determine which assignments are forced (must be true in all valid solutions) by analyzing all possible valid configurations.

Dynamic Production Sequencing problems involve finding the optimal order to process jobs when each job has a processing time and setup costs/time between different job types.

Round Robin Tournament problems involve scheduling matches where each team plays every other team exactly once (or twice). You need to calculate total matches, matches per team, and understand fairness concepts.

Single Elimination Bracket (Knockout Tournament) problems involve tournaments where losing teams are eliminated. You need to calculate total matches, number of byes, and number of rounds.

League Match Scheduling problems involve arranging matches in a sports league with home and away constraints. You need to calculate number of rounds and understand scheduling patterns.

Graph Coloring Timetable problems involve scheduling courses or events that have conflicts (cannot be at same time). Each conflict is an edge in a graph, and the minimum number of time slots equals the chromatic number of the conflict graph.

Edge Coloring Scheduling problems involve assigning matches to rounds such that no team plays twice in the same round. This is equivalent to edge coloring a complete graph, where each color represents a round.

Interval Graph Scheduling problems involve allocating rooms or venues to events that have fixed start and end times. The minimum number of rooms needed equals the maximum number of overlapping intervals (maximum clique size in interval graph).

Staff Shift Fairness problems involve assigning employees to shifts with different desirability weights. You need to calculate the fairness gap (difference between maximum and minimum undesirable weight assigned to any employee).

Rotating Shift Pattern problems involve employees rotating through different shifts on a regular schedule. You need to calculate how many days until an employee returns to the same shift pattern.

On-Call Scheduling problems involve distributing on-call duties across available staff members fairly. You need to calculate how many days each person is on-call, considering availability constraints.

Machine Breakdown Recovery problems involve recalculating project completion times when a machine breaks down during processing. You need to account for repair time and the impact on subsequent tasks.

JIT (Just-In-Time) Penalty Scheduling problems involve scheduling jobs with due dates, where early completion incurs holding cost (earliness penalty) and late completion incurs delay cost (tardiness penalty). Total penalty is minimized using Earliest Due Date (EDD) sequencing.

Batch Processing Scheduling problems involve processing multiple jobs simultaneously in batches, where a machine can handle up to a certain number of jobs per batch. You need to calculate the minimum total processing time.

Flow Shop Scheduling problems involve processing jobs on multiple machines in the same order (each job goes through Machine 1, then Machine 2, etc.). For 2 machines, Johnson's Rule gives the optimal sequence to minimize makespan.

Job Shop Scheduling problems involve processing jobs that have different routes through multiple machines (each job may visit machines in a different order). Finding the optimal schedule is NP-hard, but you can calculate lower bounds.

Learning Curve Scheduling problems involve time reduction as workers gain experience. Each doubling of cumulative production reduces time by a fixed percentage (learning rate). You need to calculate total production time using the learning curve formula.

Exam Invigilation Scheduling problems involve assigning teachers to invigilate exams across multiple time slots. Each time slot needs a fixed number of invigilators, and a teacher can invigilate only one exam per slot.

Course Registration Scheduling problems involve selecting courses that have prerequisites. You need to identify which courses have no prerequisites and can be taken in the first semester.

Thesis Defense Scheduling problems involve finding a time slot when all committee members are available. You need to find the intersection of availability sets and identify the earliest common slot.

Vehicle Routing Schedule problems involve delivering goods to customers with vehicles that have limited capacity. You need to calculate the minimum number of vehicles needed to serve all customers.

Airline Crew Scheduling problems involve assigning crews to flights with constraints on duty duration, minimum rest periods, and connection times. You need to find the maximum number of flights a crew can operate in one duty period.

Train Platform Allocation problems involve assigning trains to platforms such that no two trains occupy the same platform at the same time. You need to find the minimum number of platforms required.

Bus Timetable Optimization problems involve determining the minimum number of buses needed to maintain a given frequency (headway) on a bus route, considering round trip time.

Operating Room Scheduling problems involve assigning surgeries to operating rooms with fixed hours per day. You need to determine if all surgeries can be completed within available OR capacity.

Nurse Patient Assignment problems involve determining the minimum number of nurses needed to care for a given number of patients, where each nurse can handle at most a certain number of patients.

Clinic Appointment Scheduling problems involve determining how many patients can be seen within clinic operating hours given fixed appointment slot durations.

Data Sufficiency Scheduling problems present a scheduling question followed by two statements. You must determine if each statement alone, or both together, provide enough information to answer uniquely.

Constraint Redundancy problems involve identifying which constraints in a scheduling problem are redundant (implied by other constraints) and do not add new information.

Nested Schedule Optimization problems involve scheduling operations across multiple production lines, where each operation must be performed on a specific line. You need to identify the bottleneck line (with highest total load) and calculate its load.

Schedule Feasibility Check problems involve determining whether a set of scheduling constraints can be satisfied simultaneously. You need to check for contradictions or cycles in the constraints.

Multi-Objective Scheduling problems involve optimizing multiple conflicting objectives (e.g., minimize time and minimize cost). The Pareto frontier contains solutions where no objective can be improved without worsening another.

Fuzzy Time Scheduling problems involve tasks with uncertain durations given as three estimates: optimistic (a), most likely (m), and pessimistic (b). The expected duration is calculated using the PERT formula: (a + 4m + b)/6.

Preemptive Scheduling (Round Robin) problems involve scheduling processes where each process runs for a fixed time quantum before being preempted. You need to calculate average completion time or turnaround time.

Real-Time Task Scheduling problems involve scheduling periodic tasks with deadlines. Rate Monotonic Scheduling (RMS) assigns higher priority to tasks with shorter periods. The Liu and Layland bound determines schedulability.

Maintenance Scheduling problems involve planning preventive maintenance for machines. By staggering maintenance, you ensure that not all machines are down at once. You need to determine the maximum number of machines that can remain operational.

Event Staff Scheduling problems involve determining the minimum number of staff needed to cover an event where staffing requirements vary by hour. Staff can work multiple consecutive hours.