On the existence of dominating 6-cyclic schedules in four-machine robotic cells

Vladimir Kats and Eugene Levner

European Journal of Operational Research, 2018, vol. 268, issue 2, 755-759

Abstract: We consider a four-machine robotic cell producing identical parts and served by a single robot. We study the no-wait multi-cyclic scheduling problem. Using the forbidden-intervals method, we show that in such a cell the optimal schedule can be k-cyclic with minimum k ≥ 6. This fact refutes Agnetis’ conjecture (Agnetis, 2000) stating that the minimum k for the optimal k-cyclic m-machine schedules does not exceed m−1. In particular, we construct a counter-example to Agnetis’ conjecture.

Keywords: Scheduling; Robotic cells; Cyclic scheduling; Dominating schedule (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221718300705
Full text for ScienceDirect subscribers only

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: https://EconPapers.repec.org/RePEc:eee:ejores:v:268:y:2018:i:2:p:755-759

DOI: 10.1016/j.ejor.2018.01.034

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().