Scheduling Unrelated Parallel Machines Under Machine Eligibility Constraints in Thailandûs Hard Disk Drive Industry

Sangsawang, Chatnugrob; Sethanun, Dr.Kanchana

doi:10.5481/kkujgs.2010.10.1.3

KKUJ.GS.

2010

DOI: 10.5481/kkujgs.2010.10.1.3

|View full text |Cite

Scheduling Unrelated Parallel Machines Under Machine Eligibility Constraints in Thailandûs Hard Disk Drive Industry

Chatnugrob Sangsawang¹,

Dr.Kanchana Sethanun²

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2015

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

Moonsri¹,

Sethanan²,

Sangsawang³

2015

CMUJNS

Self Cite

View full text Add to dashboard Cite

This research focuses on the parallel machines scheduling problem in the hard disk drive industry, with the objective of minimizing the makespan. In this problem, unrelated parallel machines with sequence-dependent setup time and machine eligibility are considered. This problem can be formulated as a deterministic R m |M j ,S jk |C max problem. To solve the problem, a mathematical model is developed for small-sized problems. For large-scale problems, algorithms based on a constructive heuristic (Unrelated Parallel Machines with Sequence-Dependent Setup Times and Machine eligibility (UPSDSTM)) and Differential Evolution (DE) are applied. The results demonstrate that the DE algorithm is very efficient. It yields higher relative improvement (RI) on the makespan.

show abstract

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

Moonsri¹,

Sethanan²,

Sangsawang³

2015

CMUJNS

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Scheduling Unrelated Parallel Machines Under Machine Eligibility Constraints in Thailandûs Hard Disk Drive Industry

Cited by 1 publication

References 0 publications

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

Metaheuristics for Scheduling Unrelated Parallel Machines with Sequence-Dependent Setup Time and Machine Eligibility

Contact Info

Product

Resources

About