The University of Southampton
University of Southampton Institutional Repository

Scheduling of coupled tasks and one-machine no-wait robotic cells

Scheduling of coupled tasks and one-machine no-wait robotic cells
Scheduling of coupled tasks and one-machine no-wait robotic cells
Coupled task scheduling problems were first studied more
than 25 years ago. Several complexity results have been
established in the meantime, but the status of the identical task case still remains unsettled. We describe a new class of equivalent one-machine no-wait robotic cell problems. It turns out that scheduling of identical coupled tasks corresponds to the production of a single part type in a robotic cell. We describe new algorithmic procedures to solve this robotic cell problem, allowing lower and upper bounds on the production time, and discussing in particular cyclic production plans.
coupled tasks, robotic cells, cyclic production
0305-0548
301-307
Brauner, Nadia
d182b9b3-fe99-4e81-bccc-0b2dc9dd8189
Finke, Gerd
41f879d5-c8f2-4ce5-a1aa-aa93afd3a55f
Lehoux-Lebacque, Vassilissa
1dbf2ede-bd28-47cd-b6d3-8a3c311f7cc4
Potts, Chris
58c36fe5-3bcb-4320-a018-509844d4ccff
Whitehead, Jonathan David
3fc464ce-a5d2-4a43-b49a-9f5ed021d648
Brauner, Nadia
d182b9b3-fe99-4e81-bccc-0b2dc9dd8189
Finke, Gerd
41f879d5-c8f2-4ce5-a1aa-aa93afd3a55f
Lehoux-Lebacque, Vassilissa
1dbf2ede-bd28-47cd-b6d3-8a3c311f7cc4
Potts, Chris
58c36fe5-3bcb-4320-a018-509844d4ccff
Whitehead, Jonathan David
3fc464ce-a5d2-4a43-b49a-9f5ed021d648

Brauner, Nadia, Finke, Gerd, Lehoux-Lebacque, Vassilissa, Potts, Chris and Whitehead, Jonathan David (2009) Scheduling of coupled tasks and one-machine no-wait robotic cells. Computers & Operations Research, 36 (2), 301-307. (doi:10.1016/j.cor.2007.10.003).

Record type: Article

Abstract

Coupled task scheduling problems were first studied more
than 25 years ago. Several complexity results have been
established in the meantime, but the status of the identical task case still remains unsettled. We describe a new class of equivalent one-machine no-wait robotic cell problems. It turns out that scheduling of identical coupled tasks corresponds to the production of a single part type in a robotic cell. We describe new algorithmic procedures to solve this robotic cell problem, allowing lower and upper bounds on the production time, and discussing in particular cyclic production plans.

Text
CORCoupledTasksE-Prints.pdf - Accepted Manuscript
Download (137kB)

More information

Published date: February 2009
Keywords: coupled tasks, robotic cells, cyclic production
Organisations: Operational Research

Identifiers

Local EPrints ID: 149855
URI: https://eprints.soton.ac.uk/id/eprint/149855
ISSN: 0305-0548
PURE UUID: 3657a7aa-450a-4020-ab34-d1d70d8a4a2f

Catalogue record

Date deposited: 04 May 2010 08:39
Last modified: 28 Oct 2019 21:41

Export record

Altmetrics

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×