4.7 Article

Minimum makespan task sequencing with multiple shared resources

Journal

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING
Volume 20, Issue 2, Pages 143-150

Publisher

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.rcim.2003.10.003

Keywords

scheduling; robotic cells; job shop heuristic algorithm; complexity analysis

Ask authors/readers for more resources

In this paper we study the general problem of sequencing multiple jobs, where each job consists of multiple ordered tasks and tasks execution requires simultaneous usage of several resources. In particular, the case of an automatic assembly cell is examined. NP-completeness results are given. A heuristic is designed and evaluated. (C) 2003 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available