Scheduling method of robotic cells with robot-collaborated process and residency constraints
| Autor: | Ming Li, Bing-hai Zhou |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
Engineering Mathematical optimization 021103 operations research Job shop scheduling business.industry Mechanical Engineering 0211 other engineering and technologies Aerospace Engineering 02 engineering and technology Upper and lower bounds Automation Computer Science Applications Scheduling (computing) 020901 industrial engineering & automation Circulatory time Search algorithm Programming paradigm Robot Electrical and Electronic Engineering business |
| Zdroj: | International Journal of Computer Integrated Manufacturing. 30:1164-1178 |
| ISSN: | 1362-3052 0951-192X |
| Popis: | As a typical NP-hard optimisation problem, the Robotic Cells Scheduling Problem (RCSP) concerning how to obtain the optimum sequence of robot activities widely exists in the fields of incorporate automation and repetitive processing. A RCSP with residency constraints and robot-collaborated process (RCP), where robots concurrently perform collaborated tasks (e.g. accurately readjust location, measure size and add reagent) in addition to part transportation, is presented in this paper. According to the constraints in real engineering practise, a non-linear programming model of single-gripper robotic cells is established to minimise the average manufacturing cycle time. A Tabu Circulatory Time Point (TCTP) searching algorithm is proposed on the basis of analyses. In addition, a lower bound (LB) on the average manufacturing cycle time is established. Finally, through extensive simulation experiments, the results indicate that the proposed algorithm can generate high-quality solutions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
| Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |