Abstract
We consider a variant on the general workload balancing problem, which arises naturally in automated manufacturing and throughput optimization of assembly-lines. The problem is to distribute the tasks over compatible machines and phases of the process simultaneously. The total duration of all phases is to be minimized. We have proved that this variant is NP-hard (even for uniform task lengths), and we propose a novel algorithmic approach. Our approach includes an exact solver for the case of uniform task lengths, which is based on network-flow techniques and runs in polynomial time for a fixed number of phases (the number of phases is indeed very small in practice). To solve the general case with arbitrary real task lengths, we combine our solver for uniform task lengths with a shortest-path based multi-exchange local search.
We present results of an extensive computational study on real-world examples from printed circuit board manufacturing. This study demonstrates that our approach is very promising. The solution quality obtained by our approach is compared with lower bounds from an integer linear programming model. It turns out that our approach is faster than CPLEX by orders of magnitude, and the optimality gap is quite small.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)
Scholl, A.: Balancing and Sequencing of Assembly Lines, 2nd edn. Physica-Verlag, Heidelberg (1999)
Crama, Y., Klundert, J., Spieksma, F.C.R.: Production planning problems in printed circuit board assembly. Discrete Applied Mathematics 123, 339–361 (2002)
Ayob, M., Cowling, P., Kendall, G.: Optimisation of surface mount placement machines. In: Proceedings of IEEE International Conference on Industrial Technology, pp. 486–491 (2002)
Wang, W., Nelson, P.C., Tirpak, T.M.: Optimization of high-speed multistation SMT placement machines using evolutionary algorithms. IEEE Transactions on Electronic Packaging and Manufacturing 22, 137–146 (1999)
Müller-Hannemann, M., Weihe, K.: Moving policies in cyclic assembly-line scheduling. Theoretical Computer Science 351, 425–436 (2006)
Grunow, M., Günther, H.O., Schleusener, M.: Component allocation for printed circuit board assembly using modular placement machines. International Journal of Production Research 41, 1311–1331 (2003)
Ahuja, R.K., et al.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics 123, 75–102 (2002)
Frangioni, A., Necciari, E., Scutellà , M.G.: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems. J. Comb. Optim. 8, 195–220 (2004)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tazari, S., Müller-Hannemann, M., Weihe, K. (2006). Workload Balancing in Multi-stage Production Processes. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_5
Download citation
DOI: https://doi.org/10.1007/11764298_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34597-8
Online ISBN: 978-3-540-34598-5
eBook Packages: Computer ScienceComputer Science (R0)