Abstract
In this paper, a dry-or-buy cost model for a dry kiln scheduling problem in the furniture manufacturing industry is considered. Factory-specified due-dates for jobs, kiln availability, kiln capacity, and drying and buying costs are incorporated into an Integer-Programming (IP) model. As it may be difficult (i.e., because of due-dates, kiln availability, processing times, etc.) to meet all the due-dates, certain jobs may have to be out-sourced. The objective of the model is to minimize the total drying and buying costs while satisfying all due-dates. Because of the computational complexity of the problem, a heuristic approach is developed. Computational experience indicates that the heuristic gives high quality solutions with significant savings in time over standard IP algorithms.
References
Aggarwal, A.K., Vemuganti, R.R. and Fetner, W. (1992) A model-based decision support system for scheduling lumber drying operations. Production and Operations Management, 1(1), 320-328.
Cheng, T.C.E. and Sin, C.C.S. (1990) A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research, 47, 271-292.
Demirkol, E., Mehta, S. and Uzsoy, R. (1998) Benchmarks for shop scheduling problems. European Journal of Operational Research, 109, 137-141.
Garey, M.R. and Johnson, D.S. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, New York, NY.
Guinet, A., Echalier, F. and Dussauchoy, A. (1992) Scheduling jobs on parallel machines: a survey. Technical report, Laboratorie d'Informatique des Systems de Production Industriels, Bat. 710, Universite Claude Bernard, Villeurbanne, France.
Huang, J.C.-C. (1995) Decision support system for lumber procurement and dry kiln scheduling: a fuzzy system theory application. Working paper, Industrial Engineering Department, North Carolina State University, Raleigh, NC.
Lee, C.Y. (1991) Parallel machine scheduling with nonsimultaneous machine available times. Discrete Applied Mathematics, 30, 53-61.
Lin, S. and Kernighan, B.W. (1973) An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498-516.
Panwalkar, S.S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25, 45-61.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yaghubian, A.R., Hodgson, T.J. & Joines, J.A. Dry-or-buy decision support for dry kiln scheduling in furniture production. IIE Transactions 33, 131–136 (2001). https://doi.org/10.1023/A:1007603002606
Issue Date:
DOI: https://doi.org/10.1023/A:1007603002606