Heuristic algorithms for a delivery workload balancing problem in an assembly plant
In this paper, a delivery workload balancing problem in an assembly plant is considered. The problem is first described as a special case of the unrelated parallel machine scheduling problem of minimizing the makespan. Then, a polynomial time heuristic algorithm is proposed, which is regarded as a d...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Japan Society of Mechanical Engineers
2016-07-01
|
| Series: | Journal of Advanced Mechanical Design, Systems, and Manufacturing |
| Subjects: | |
| Online Access: | https://www.jstage.jst.go.jp/article/jamdsm/10/4/10_2016jamdsm0056/_pdf/-char/en |