Flow Shop Scheduling Problem with Transportation Times, Two-Robots and Inputs/Outputs with Limited Capacity

Lamoudan, Tarik and Elkhoukhi, Fatima and Boukachour, Jaouad and Elhilali alaoui, Ahmed (2011) Flow Shop Scheduling Problem with Transportation Times, Two-Robots and Inputs/Outputs with Limited Capacity. International Journal of Intelligent Computing Research (IJICR), 2 (1/2/3/). pp. 244-253.

[img]
Preview
PDF
Flow Shop Scheduling Problem with Transportation Times, Two-Robots .pdf

Download (856kB) | Preview

Abstract

In this paper we study a generalized flow-shop problem with two identical transport robots between machines. Besides transportation times for the jobs, empty moving times for the robots are taken into account. The objective is to minimize the Makespan. An ant colony algorithm with appropriate probability transfer structures is proposed. Computational results are presented for test data arising from flow-shop benchmark instances enlarged by transportation and empty moving times.

Item Type: Article
Subjects: Computer Sciences
Mathematics
Divisions: College of Sciences and Arts - Mahyal Aseer > Mathematics
Depositing User: tarik LAMOUDAN
Date Deposited: 15 Jan 2017 13:48
Last Modified: 15 Jan 2017 13:48
URI: http://eprints.kku.edu.sa/id/eprint/317

Actions (login required)

View Item View Item