Green fuzzy parallel machine scheduling with sequence-dependent setup in the plastic moulding industry
by Khodakaram Salimifard; Davood Mohammadi; Reza Moghdani; Abbas Abbasizad
Asian J. of Management Science and Applications (AJMSA), Vol. 4, No. 1, 2019

Abstract: Job scheduling has always been a challenging task for production managers. It is of special importance if it involves multi-objectives and parallel machines. In this research, our direction is largely motivated by the uncertainty emerged in production systems, where processing times of jobs and setup times of machines are not fixed and they are subject to some uncertainties. Our paper presents a mixed-integer goal programming model considering fuzzy approach for parallel machines environments with separable jobs, sequence-dependent setup times and hazardous waste. Two fuzzy objectives are considered in the model to minimise the total tardiness and the total hazardous waste. Since the model is too complex to be solved using exact methods, we proposed a solution method based on genetic algorithm. To set the input parameters of the solution algorithm, Taguchi method is used. The results of the computational experiments indicate that the proposed algorithm is a proficient method and has efficiently found the optimal solutions for both objective functions.

Online publication date: Wed, 07-Aug-2019

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 Asian J. of Management Science and Applications (AJMSA):
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