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

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

Tarik Lamoudan, Fatima El Khoukhi, A. El Alaoui, Jaouad Boukachour

Year
2012
Citations
7
Access
Open access

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.

Keywords

Scheduling (production processes)Flow shop schedulingComputer scienceRobotFlow (mathematics)Operations researchJob shop schedulingOperations managementEngineeringMathematics

Related papers

Browse all OTHER papers