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: | LIM, Andrew, RODRIGUES, Brian, WANG, Caixia |
---|---|
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 |
Similar Items
-
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
by: Iravani, S.M.R., et al.
Published: (2013) -
A Simulated Annealing with Hill Climbing Algorithm for the Traveling Tournament Problem
by: LIM, Andrew, et al.
Published: (2006) -
Minimizing Total Flow Time in Single Machine Environment with Release Time
by: GUO, Yunsong, et al.
Published: (2004) -
Crossdocking: JIT Scheduling with Time Windows
by: LI, Yanzhi, et al.
Published: (2004) -
A m-Parallel Crane Scheduling Problem with a Non-Crossing Constraint
by: LIM, Andrew, et al.
Published: (2007)