Scheduling with setup time matrix for sequence dependent family
Joint Authors
Nataraj, Senthilvel
Sankareswaran, Umamaheshwari
Thulasiram, Hemamalini
Varadharajan, Senthiil
Source
The International Arab Journal of Information Technology
Issue
Vol. 16, Issue 2 (31 Mar. 2019)7 p.
Publisher
Publication Date
2019-03-31
Country of Publication
Jordan
No. of Pages
7
Main Subjects
Information Technology and Computer Science
Abstract EN
We consider a problem of scheduling n jobs in k families on a single machine subjected to family set-up time to minimize the overall penalty.
This paper proposes three heuristic approaches based on neighbourhood structures using setup time matrix.
These three approaches minimize the maximum penalty which in turn minimizes the total penalty.
Inserting the Idle Time initially (ITF approach) or between the families perform efficiently on large instances.
The computational results prove the efficiency of the algorithm.
American Psychological Association (APA)
Nataraj, Senthilvel& Sankareswaran, Umamaheshwari& Thulasiram, Hemamalini& Varadharajan, Senthiil. 2019. Scheduling with setup time matrix for sequence dependent family. The International Arab Journal of Information Technology،Vol. 16, no. 2.
https://search.emarefa.net/detail/BIM-895011
Modern Language Association (MLA)
Nataraj, Senthilvel…[et al.]. Scheduling with setup time matrix for sequence dependent family. The International Arab Journal of Information Technology Vol. 16, no. 2 (Mar. 2019).
https://search.emarefa.net/detail/BIM-895011
American Medical Association (AMA)
Nataraj, Senthilvel& Sankareswaran, Umamaheshwari& Thulasiram, Hemamalini& Varadharajan, Senthiil. Scheduling with setup time matrix for sequence dependent family. The International Arab Journal of Information Technology. 2019. Vol. 16, no. 2.
https://search.emarefa.net/detail/BIM-895011
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-895011