Two-machine Flow Shop Problems with a Single Server
A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has one...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/559 https://doi.org/10.1007/s10951-006-8787-z |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.lkcsb_research-1558 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.lkcsb_research-15582016-03-11T12:53:54Z Two-machine Flow Shop Problems with a Single Server LIM, Andrew RODRIGUES, Brian WANG, Caixia A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage’s processing. Types of robotic cells are differentiated from one another by certain characteristics, including robot type, robot travel-time, number of robots, types of parts processed, and use of parallel machines within stages. We focus on cyclic production of parts. A cycle is specified by a repeatable sequence of robot moves designed to transfer a set of parts between the machines for their processing. 2006-12-01T08:00:00Z text https://ink.library.smu.edu.sg/lkcsb_research/559 info:doi/10.1007/s10951-006-8787-z https://doi.org/10.1007/s10951-006-8787-z Research Collection Lee Kong Chian School Of Business eng Institutional Knowledge at Singapore Management University Machine scheduling Flow shop Heuristics Robots Operations and Supply Chain Management |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Machine scheduling Flow shop Heuristics Robots Operations and Supply Chain Management |
spellingShingle |
Machine scheduling Flow shop Heuristics Robots Operations and Supply Chain Management LIM, Andrew RODRIGUES, Brian WANG, Caixia Two-machine Flow Shop Problems with a Single Server |
description |
A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage’s processing. Types of robotic cells are differentiated from one another by certain characteristics, including robot type, robot travel-time, number of robots, types of parts processed, and use of parallel machines within stages. We focus on cyclic production of parts. A cycle is specified by a repeatable sequence of robot moves designed to transfer a set of parts between the machines for their processing. |
format |
text |
author |
LIM, Andrew RODRIGUES, Brian WANG, Caixia |
author_facet |
LIM, Andrew RODRIGUES, Brian WANG, Caixia |
author_sort |
LIM, Andrew |
title |
Two-machine Flow Shop Problems with a Single Server |
title_short |
Two-machine Flow Shop Problems with a Single Server |
title_full |
Two-machine Flow Shop Problems with a Single Server |
title_fullStr |
Two-machine Flow Shop Problems with a Single Server |
title_full_unstemmed |
Two-machine Flow Shop Problems with a Single Server |
title_sort |
two-machine flow shop problems with a single server |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2006 |
url |
https://ink.library.smu.edu.sg/lkcsb_research/559 https://doi.org/10.1007/s10951-006-8787-z |
_version_ |
1770569612098797568 |