Abstract
We consider an assembly line problem that occurs in various kinds of production automation, for example, in the automated manufacturing of PC boards. The assembly line has to process a (potentially infinite) number of identical workpieces in a cyclic fashion. In contrast to common variants of assembly–line scheduling, the forward steps may be smaller than the distance of two stations. Therefore, each station may process parts of several workpieces at the same time, and parts of a workpiece may be processed by several stations at the same time. The throughput rate is determined by the number of (cyclic) forward steps, the offsets of the individual forward steps, and the distribution of jobs over the stationary stages between the forward steps. Even for a given number of forward steps and for given offsets of the forward steps, the optimal assignment of the jobs to the stationary stages is at least weakly \({\cal NP}\)–hard.
We will base our algorithmic considerations on some quite conservative assumptions, which are greatly fulfilled in various application scenarios, including the one in our application: the number of jobs may be huge, but the number of stations and the number of forward steps in an optimal solution are small, the granularity of forward steps is quite coarse, and the processing times of the individual items do not differ by several orders of magnitude from each other. We will present an algorithm that is polynomial and provably deviates from optimality to a negligible extent (under these assumptions). This result may be viewed as an application of fixed–parameter tractability to a variety of real–world settings.
This work has been partially supported by DFG grant MU 1482/2.
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
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)
Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: a parameterized point of view. Discrete Mathematics 229, 3–27 (2001)
Bodlaender, H., Downey, R., Fellows, M., Hallett, M., Wareham, H.T.: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11, 49–57 (1995)
Brucker, P.: Scheduling algorithms. Second revised and enlarged ed., Springer, Heidelberg (1997)
Crama, Y., van de Klundert, J., Spieksma, F.C.R.: Production planning problems in printed circuit board assembly. Discrete Applied Mathematics 123, 339–361 (2002)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, Heidelberg (1999)
Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity: A framework for systematically confronting computational intractability. In: Graham, R.L., Kratochvil, J.N., Roberts, F.S. (eds.). DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, pp. 49–99 (1999)
Fellows, M.: Parameterized complexity: The main ideas and connections to practical computing. In: Harland, J. (ed.). Electronic Notes in Theoretical Computer Science, vol. 61, Elsevier Science Publishers, Amsterdam (2002)
Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman, New York (1979)
Scholl, A.: Balancing and sequencing of assembly lines, 2nd edn. Physica- Verlag, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller-Hannemann, M., Weihe, K. (2004). Moving Policies in Cyclic Assembly-Line Scheduling. In: Downey, R., Fellows, M., Dehne, F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28639-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-28639-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23071-7
Online ISBN: 978-3-540-28639-4
eBook Packages: Springer Book Archive