A mathematical formulation and anarchic society optimisation algorithms for integrated scheduling of processing and transportation operations in a flow-shop environment

Amir Ahmadi-Javid and Pedram Hooshangi-Tabrizi

International Journal of Production Research, 2015, vol. 53, issue 19, 5988-6006

Abstract: This paper addresses a permutation flow-shop scheduling problem where there are a finite number of transporters to carry jobs from each machine to its subsequent machine. The problem is first formulated as a mixed-integer linear programme, and then two anarchic society optimisation (ASO) algorithms are developed to solve large-sized instances of the problem. The numerical experience shows that the ASO algorithms are considerably effective and efficient. Finally, a sensitivity analysis is carried out to study the performance of the manufacturing system versus the transportation times and the number of transporters.

Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/00207543.2015.1035812 (text/html)
Access to full text is restricted to subscribers.

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:taf:tprsxx:v:53:y:2015:i:19:p:5988-6006

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TPRS20

DOI: 10.1080/00207543.2015.1035812

Access Statistics for this article

International Journal of Production Research is currently edited by Professor A. Dolgui

More articles in International Journal of Production Research from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().