An optimal resource allocation algorithm, Hungarian algorithm, is not directly applicable to manufacturing scheduling problems, because solutions of resource allocation problems may violate precedence constraints among processes that constitute individual manufacturing jobs. To apply Hungarian algorithm to scheduling problems, in this paper, several strategies for assigning prices to time slots of individual machines, which are allocated to processes, are proposed. Preliminary experimentation results showed that these strategies can generate near optimal schedules, i.e. when lengths of scheduling horizons were larger than 3 times of the maximum lengths of jobs, generated schedules could complete given jobs while maintaining the deterioration of the efficiency less than 5% from optimal schedules.
[1]
Mehmet Emin Aydin,et al.
Dynamic job-shop scheduling using reinforcement learning agents
,
2000,
Robotics Auton. Syst..
[2]
J. Herrmann,et al.
Hierarchical production planning with part, spatial and time aggregation
,
1994,
Proceedings of the Fourth International Conference on Computer Integrated Manufacturing and Automation Technology.
[3]
Kazuhiko Kawamura,et al.
Contract-net-based scheduling for holonic manufacturing systems
,
1997,
Other Conferences.
[4]
Krishna R. Pattipati,et al.
Schedule generation and reconfiguration for parallel machines
,
1990,
IEEE Trans. Robotics Autom..