Parallel Machine Scheduling with Resources Constraint and Sequence Dependent Setup Times

Zheng-liang Hou and Xiu-ping Guo ()
Additional contact information
Zheng-liang Hou: Southwest Jiaotong University
Xiu-ping Guo: Southwest Jiaotong University

Chapter Chapter 80 in Proceedings of 2012 3rd International Asia Conference on Industrial Engineering and Management Innovation (IEMI2012), 2013, pp 801-811 from Springer

Abstract: Abstract This paper considered the scheduling problem of minimizing makespan on parallel machines with multiple resources constraint and job sequence dependent setup times. We proposed a mixed integer programming model to formulate the problem and used commercial software to get the optimal solution and Gantt chart of a small-size case. Then a Genetic Algorithm (GA) was developed to solve the problem in an acceptable time for large-size cases. Computational experiences shown that the proposed GA can achieve high quality solutions comparable to those obtained by commercial software and outperform the schedule rules existing in real manufacturing operation.

Keywords: Genetic Algorithm; Makespan; Parallel machine; Resources constraint; Scheduling; Sequence dependent setup times (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-33012-4_80

Ordering information: This item can be ordered from
http://www.springer.com/9783642330124

DOI: 10.1007/978-3-642-33012-4_80

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().