A multi-objective decision-making framework using preference selection index for assembly job shop scheduling problem
by Midhun Paul; R. Sridharan; T. Radha Ramanan
International Journal of Management Concepts and Philosophy (IJMCP), Vol. 9, No. 4, 2016

Abstract: Assembly job shop scheduling problem (AJSSP) is an important NP-hard scheduling problem very difficult to solve because of its complex precedence relationship between jobs and product structures. In the present work, a systematic multi-attribute decision-making methodology namely, preference selection index method is adopted for ranking priority dispatching rules for scheduling an assembly job shop. A simulation model of an assembly job shop with seven work stations and one assembly station is developed for the purpose of experimentation. Eight priority dispatching rules from literature are identified and incorporated in the simulation model. Performance measures considered for analysis include mean flow time, maximum flow time, mean tardiness, maximum tardiness and machine utilisation. Products with single level assembly structure, two level assembly structure and three level assembly structure are examined to demonstrate and to check the applicability of the proposed methodology. The best performing priority dispatching rules are determined in a multi-objective environment.

Online publication date: Mon, 17-Oct-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Management Concepts and Philosophy (IJMCP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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