A heuristic for priority-based scheduling in a turbine manufacturing job-shop Online publication date: Fri, 10-Oct-2008
by Sandeep Dulluri, V. Mahesh, C.S.P. Rao
International Journal of Industrial and Systems Engineering (IJISE), Vol. 3, No. 6, 2008
Abstract: The increasing importance of make-to-order manufacturing, inventory reduction and resource optimisation have placed further emphasis on the growing role of scheduling in the current global business environment. Often there has been a problem of applying the mathematically rich concepts of scheduling theory to solve the real-time industrial problems – in particular the problem of job-shop scheduling. In this context, in our current work, we develop a priority-based heuristic for minimising the makespan for a turbine manufacturing industry. This heuristic gives the optimal schedule based on the dynamic priorities of the customer work orders. We also propose bounds for makespan in job-shop scheduling environment. There are a host of issues addressed by the job shop scheduling system, like resource break-down, reentrance of the jobs on the resources that are already visited by the job. Our research helps in connecting the academic theory with real-time industrial scheduling problem to get better quality results.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook