Scheduling in robotic cells with time window constraints
by Wassim Zahrouni; Hichem Kamoun
European J. of Industrial Engineering (EJIE), Vol. 15, No. 2, 2021

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]

Online publication date: Tue, 06-Apr-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email