Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Multi-decision points model to solve coupled-task scheduling problem with heterogeneous multi-AGV in manufacturing systems

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Publication Information:
      Growing Science, 2023.
    • Publication Date:
    • Collection:
      LCC:Industrial engineering. Management engineering
      LCC:Production management. Operations management
    • Abstract:
      Automated guided vehicle (AGV) is widely used in automated manufacturing systems as a material handling tool. Although the task scheduling problem with isomorphic AGV has remained a very active research field through the years, too little work has been devoted to the task scheduling problems with heterogeneous AGVs. A coupled task with heterogeneous AGVs is a complex task that needs the cooperation of more than one type of AGVs. In this paper, a manufacturing system with two types of AGVs and three types of tasks is studied. To solve the coupled task scheduling problem with heterogeneous AGVs in this manufacturing system, we introduce two new methods based on the established mathematical model, namely, the decoupled scheduling strategy and coupled scheduling strategy with multi-decision model. The decoupled scheduling strategy is widely used in coupled task scheduling problems. However, there are some situations that the decoupled scheduling strategy cannot solve the problem well. To overcome the problem, the multi-decision point model solves the coupled task scheduling problem without decomposition. In order to ensure the searching speed and searching accuracy, a novel hybrid heuristic algorithm based on simulated annealing algorithm and tabu search algorithm is developed. The simulation experiment results show the proposed coupled scheduling algorithm has priority in coupled task scheduling problems.
    • File Description:
      electronic resource
    • ISSN:
    • Relation:;;
    • Accession Number:
    • Accession Number: