Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing

Authors:
V. Mahesh;L. Siva Rama Krishna;Sandeep Dulluri;C. S. P. Rao
Affiliations:
S. R. Engineering College, India;Osmania University, India;IBM India Pvt. Ltd, India;National Institute of Technology, Warangal, India
Venue:
International Journal of Green Computing
Year:
2011

Citing 6
Cited 0

Single machine scheduling with controllable release and processing parameters

Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems

Computers and Industrial Engineering
Multi-objective scheduling of dynamic job shop using variable neighborhood search

Expert Systems with Applications: An International Journal
An efficient job-shop scheduling algorithm based on particle swarm optimization

Expert Systems with Applications: An International Journal
An Ant Colony System Algorithm for the Hybrid Flow-Shop Scheduling Problem

International Journal of Applied Metaheuristic Computing
Optimal Server Allocation and Frequency Modulation on Multi-Core Based Server Clusters

International Journal of Green Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.