Scribd
Upload
233 views10 pages

NP-hard Scheduling Problems

np hard scheduling problem

Uploaded by

raj deep das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
233 views10 pages

NP-hard Scheduling Problems

np hard scheduling problem

Uploaded by

raj deep das
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

NP-HARD

SCHEDULING
PROBLEMS
Subject:DESIGN AND ANALYSIS OF ALGORITHMS

Snehal Nathankar 2022-B-26082004C


Rajdeep Das 2022-B-18072004A
Sandesh Hatwar 2022-B-22082004C
Arya Narendra kavitkar 2022-B-16062004C
Pallavi Patil 2022-B-05032004E
INTRODUCTION TO NP-
HARD SCHEDULING
PROBLEMS
 What are Scheduling Problems?

• Tasks must be assigned to resources (e.g., processors or machines) over time.

• Goal: Optimize criteria like time, cost, or efficiency.

 What makes them NP-hard?

• NP-hard problems are computationally challenging.

• Finding an exact solution is infeasible for large inputs.

• Scheduling problems often involve combinatorial complexity.


IDENTICAL PROCESSORS SCHEDULING
 Definition:

• Tasks are assigned to a set of identical processors.

• Processors have the same speed and capability.

 Objective:

• Minimize total completion time (makespan).

 Example Problem:

• Divide 10 tasks of different durations among 3 identical processors to minimize the total time.

 Complexity:

• NP-hard because determining the optimal schedule is computationally intense.

 Applications:

• Cloud computing, parallel processing in software systems.


FLOW SHOP SCHEDULING
 Definition:

• A production environment with a fixed sequence of machines.


• Tasks must pass through machines in the same order.
 Objective:

• Minimize makespan, tardiness, or flow time.


 Example Problem:

• Three machines (M1, M2, M3) process five jobs in the same sequence: J1 → J2 → J3 → J4 →
J5.
 Characteristics:

• Requires finding the optimal permutation of jobs.


 Complexity:

• NP-hard for more than 2 machines.


 Applications:

• Manufacturing, assembly lines, textile production.


JOB SHOP SCHEDULING
 Definition:

• Each job has its own sequence of operations on different machines.


• Machines may process different jobs in varying orders.
 Objective:

• Minimize makespan, tardiness, or flow time.


 Example Problem:

• Job A requires: M1 → M2 → M3
• Job B requires: M3 → M1 → M2
• Find the schedule with minimum total time.
 Characteristics:

• Most general and complex scheduling problem.


 Complexity:

• Strongly NP-hard.
 Applications:

• Aircraft maintenance, custom manufacturing, hospital scheduling.


COMPARISON OF
SCHEDULING TYPES
Identical
Criteria Flow Shop Job Shop
Processors
Identical processors Machines in Machines with
Resource Type
sequence flexibility
Task Order Flexible Fixed sequence Job-specific sequence
Complexity High Higher Very High
Applications Parallel computing Assembly lines Custom manufacturing
SOLVING NP-HARD
SCHEDULING PROBLEMS
 Methods to Solve:

1.Exact Algorithms:
 Branch-and-Bound, Integer Programming.
 Feasible only for small problems.

2.Heuristics:
 Priority rules, shortest processing time first (SPT).
 Quick, but suboptimal solutions.

3.Metaheuristics:
 Genetic Algorithms, Simulated Annealing, Ant Colony Optimization.
 Balance between efficiency and solution quality.

4.Approximation Algorithms:
 Polynomial-time algorithms for near-optimal solutions.
CHALLENGES AND FUTURE
DIRECTIONS
 Challenges:

• Scalability for large problems.


• Dynamic scheduling for real-time environments.
 Future Directions:

• Integration with AI and machine learning.


• Cloud-based optimization tools.
• Hybrid approaches combining heuristics and metaheuristics.
REAL-LIFE APPLICATIONS OF
NP-HARD SCHEDULING
PROBLEMS
 1. Manufacturing
• Flow Shop Scheduling: Used in assembly lines (e.g., car production) to minimize production
time.
 2. Cloud Computing
• Identical Processors Scheduling: Tasks are distributed across processors to optimize load
balancing and minimize completion time.
 3. Healthcare
• Job Shop Scheduling: Assigning surgeries and medical procedures to rooms and staff,
minimizing wait times.
 4. Transportation
• Identical Processors & Flow Shop Scheduling: Optimizing fleet management and delivery
schedules.
 5. Robotics & Automation
• Job Shop Scheduling: Robots perform tasks on machines in industries like electronics and food
production.
CONCLUSION
•Scheduling problems are critical in various industries.
•NP-hardness makes finding optimal solutions challenging.
•Advanced techniques like heuristics and metaheuristics help manage
complexity.
•Research continues to improve algorithms and address real-world
challenges.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy