Incorporating transportation time in multi-agent production network scheduling
The scheduling of factories that work in production network is a new type of scheduling problem that all of the developed single factory techniques are inappropriate for it. The aim of this paper is to propose the scheduling algorithm for such environment in which several factories
disperse geographically in different places with parallel machines and each factory as a production agent may have a different objective function. We assume there are two types of production agent, i.e. some factories are interested in the sum of completion times and the remaining factories
are interested in the makespan. In such system, a schedule should give enough flexibility to a local scheduler. This can be attained by transporting the jobs among factories from the overloaded machine to the machine which has fewer workloads. By incorporating the transportation assumption
in problem definition, we first present a mathematical modelling for the new scheduling problem. We then used CPLEX solver to obtain Pareto solutions by applying ∈-constraint approach. Furthermore, in addition to a genetic algorithm (GA), we proposed a new evolutionary metaheuristic
namely imperialist competitive algorithm (ICA) that armed with a new encoding scheme. Finally, the outputs obtained from mathematical algorithm, ICA and GA are reported.
Keywords: Pareto solutions; distributed multi-agent production network; imperialist competitive algorithm; mathematical modelling; scheduling; transportation time
Document Type: Research Article
Affiliations: Department of Industrial Engineering,Amirkabir University of Technology, 424 Hafez AvenueTehran,15916–34311, Iran
Publication date: 01 December 2012
- Editorial Board
- Information for Authors
- Subscribe to this Title
- Ingenta Connect is not responsible for the content or availability of external websites
- Access Key
- Free content
- Partial Free content
- New content
- Open access content
- Partial Open access content
- Subscribed content
- Partial Subscribed content
- Free trial content