A multi-agent scheduling problem for two identical parallel machines to minimize total tardiness time and makespan
We study an agent-based scheduling problem of two identical parallel machines: P 2 | Co | ∑ T A , C max B . The machines and tasks are regarded as agents. A new multi-agent scheduling model is proposed to achieve the optimum from the two task agents, agent A and agent B. The objective is divided int...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SAGE Publishing
2018-02-01
|
| Series: | Advances in Mechanical Engineering |
| Online Access: | https://doi.org/10.1177/1687814018756103 |