Unrelated parallel dedicated machine scheduling with sequence dependent setup times: an application in a textile company Online publication date: Tue, 11-Oct-2022
by Yonca Erdem Demirtas
International Journal of Applied Decision Sciences (IJADS), Vol. 15, No. 6, 2022
Abstract: This study deals with a real-life scheduling problem in a textile company that produces hygienic fibres. The addressed problem is a particular case of unrelated parallel dedicated machine scheduling problems with sequence-dependent setup times. The company has two unrelated production lines. Three different types of product families with due dates need to be scheduled onto the lines. The production planning problem is solved by minimising the total tardiness and total sequence-dependent setup costs. Permutation-based solution representation is used and an initial solution is generated via dispatching rules to start searching from a promising point. Powerful single solution-based local search algorithms such as 2-opt, swap, and insertion are used to improve the solution. Finally, the proposed solution technique is developed as a decision support system made available to the company for easy and efficient production planning.
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 Applied Decision Sciences (IJADS):
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