Abstract
In the material flow of a plant, parts are processed in batches, each having two distinct attributes, say shape and color. In one department, a set-up occurs every time the shape of the new batch is different from the previous one. In a downstream department, there is a set-up when the color of the new batch is different from the previous one. Since a unique sequence of batches must be established, the problem consists in finding such a common sequence optimizing an overall utility index. Here we consider two indices, namely the total number of set-ups and the maximum number of set-ups between the two departments. Both problems are shown to be NP-hard. An efficient heuristic approach is presented for the first index which allows to solve a set of real-life instances and performs satisfactorily on a large sample of experimental data.
Similar content being viewed by others
References
A.A. Bertossi, The edge Hamiltonian problem is NP-complete, Information Processing Letters 13 (1981) 157–159.
M.G. Garey, D.S. Johnson and R.E. Tarjan, The planar Hamiltonian circuit problem is NP-complete, SIAM Journal on Computing 5(4) (1976) 704–714.
F. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM Journal on Computing 4(3) (1975) 221–225.
F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1969).
F. Harary and C.St.J.A. Nash-Williams, On Eulerian and Hamiltonian graphs and line-graphs, Canadian Mathematics Bulletin 8 (1965) 701–709.
A. Raychaudhuri, The total interval number of a tree and the Hamiltonian completion number of its line graph, Information Processing Letters 56 (1995) 299–306.
D.J. Thomas and P.M. Griffin, Coordinated supply chain management, European Journal of Operational Research 94 (1996) 1–15.
H.J. Veldman, A result on Hamiltonian line graphs involving restrictions on induced subgraphs, Journal of Graph Theory 12(3) (1988) 413–420.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Agnetis, A., Detti, P., Meloni, C. et al. Set-Up Coordination between Two Stages of a Supply Chain. Annals of Operations Research 107, 15–32 (2001). https://doi.org/10.1023/A:1014934612090
Issue Date:
DOI: https://doi.org/10.1023/A:1014934612090