scholarly journals Job shop scheduling with unit time operations under resource constraints and release dates

1987 ◽  
Vol 18 (2) ◽  
pp. 227-233 ◽  
Author(s):  
Jayme Luiz Szwarcfiter
Keyword(s):  
Job Shop ◽  
Resource Constraints ◽  
Job Shop Scheduling ◽  
Release Dates ◽  
Shop Scheduling

Theoretical Analysis on Powers-of-Two Applied to JSP

2011 ◽  
Vol 2 (2) ◽  
pp. 1-20
Author(s):  
V. Mahesh ◽  
L. Siva Rama Krishna ◽  
Sandeep Dulluri ◽  
C. S. P. Rao
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimal Schedule ◽  
Optimal Solution ◽  
Mathematical Induction ◽  
Release Dates ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Optimal Value

This paper discusses the scheduling of precedence-related jobs non-preemptively in a job shop environment with an objective of minimizing the makespan. Due to the NP-hard nature of the scheduling problems, it is usually difficult to find an exact optimal schedule and hence one should rely on finding a near to optimal solution. This paper proposes a computationally effective powers-of-two heuristic for solving job shop scheduling problem. The authors prove that the makespan obtained through powers-of-two release dates lies within 6% of the optimal value. The authors also prove the efficacy of powers-of-two approach through mathematical induction.

Theoretical Analysis on Powers-of-Two Applied to JSP

2013 ◽  
pp. 66-86
Author(s):  
V. Mahesh ◽  
L. Siva Rama Krishna ◽  
Sandeep Dulluri ◽  
C. S. P. Rao
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimal Schedule ◽  
Optimal Solution ◽  
Mathematical Induction ◽  
Release Dates ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Optimal Value

This paper discusses the scheduling of precedence-related jobs non-preemptively in a job shop environment with an objective of minimizing the makespan. Due to the NP-hard nature of the scheduling problems, it is usually difficult to find an exact optimal schedule and hence one should rely on finding a near to optimal solution. This paper proposes a computationally effective powers-of-two heuristic for solving job shop scheduling problem. The authors prove that the makespan obtained through powers-of-two release dates lies within 6% of the optimal value. The authors also prove the efficacy of powers-of-two approach through mathematical induction.

Sign in / Sign up

Export Citation Format

Share Document