Economics at your fingertips  

Scheduling in robotic cells with time window constraints

Wassim Zahrouni and Hichem Kamoun

European Journal of Industrial Engineering, 2021, vol. 15, issue 2, 206-225

Abstract: This paper addresses the cyclic scheduling problem arising in two and three-machine robotic cells with time window constraints where multiple part-types are produced. Due to its complexity, very few studies have tackled the problem. Previous researches were generally limited to single or at most to two part-types where the associated part sequencing problem vanishes since the production is cyclic. We proved that the two-machine problem could be apprehended as a travelling salesman problem. For the three-machine case, we proposed a heuristic aimed at finding the sequence of robot activities and the sequence of parts that jointly minimises the cycle time in a special class of cycles. A lower bound is also provided, and computational results are reported. [Received: 18 October 2018; Revised: 22 January 2020; Accepted: 14 March 2020]

Keywords: hoist scheduling problem; HSP; robotic cells; time window constraints; cyclic scheduling; sequencing. (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link) (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:

Access Statistics for this article

More articles in European Journal of Industrial Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().

Page updated 2021-04-13
Handle: RePEc:ids:eujine:v:15:y:2021:i:2:p:206-225