A survey of algorithms for the single machine total weighted tardiness scheduling problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Weighted-tardiness scheduling on parallel machines with proportional weights
Operations Research
Asynchronous organizations for multi-algorithm problems
Asynchronous organizations for multi-algorithm problems
Synergy in cooperating agents: designing manipulators from task specifications
Synergy in cooperating agents: designing manipulators from task specifications
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Minimizing the total weighted completion time on unrelated parallel machines with stochastic times
WSC '05 Proceedings of the 37th conference on Winter simulation
| Hi-index | 0.00 |
Scheduling of multiple parallel machines in the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteed to produce optimal results. We describe a solution for an instance of this problem, in the domain of paper manufacturing. The problem has additional job machine restrictions and fixed costs of assigning jobs to machines. We consider multiple objectives such as minimizing (weighted) tardiness, minimizing job-machine assignment costs. We solve the problem using a simple agent architecture called the Asynchronous team (A-team), in which agents cooperate by exchanging results. We have built agents each of which encapsulates a different problem solving strategy for solving the multi-machine scheduling problem. The A-team framework enables the agents to cooperate to produce better results than those of any individual agent. In this paper we define the problem, describe the individual agents, and show with experimental results that the A-team produces very good results compared to schedulers alone.