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

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

V. Mahesh, L. Siva Rama Krishna, Sandeep Dulluri, C. S. P. Rao
Copyright: © 2011 |Volume: 2 |Issue: 2 |Pages: 20
ISSN: 1948-5018|EISSN: 1948-5026|EISBN13: 9781613507209|DOI: 10.4018/jgc.2011070101
Cite Article Cite Article

MLA

Mahesh, V., et al. "Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing." IJGC vol.2, no.2 2011: pp.1-20. http://doi.org/10.4018/jgc.2011070101

APA

Mahesh, V., Krishna, L. S., Dulluri, S., & Rao, C. S. (2011). Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing. International Journal of Green Computing (IJGC), 2(2), 1-20. http://doi.org/10.4018/jgc.2011070101

Chicago

Mahesh, V., et al. "Theoretical Analysis on Powers-of-Two Applied to JSP: A Case Study of Turbine Manufacturing," International Journal of Green Computing (IJGC) 2, no.2: 1-20. http://doi.org/10.4018/jgc.2011070101

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.