Dry kiln scheduling in furniture production

IIE Transactions (Institute of Industrial Engineers)

Volumn 31, Issue 8, 1999, Pages 733-738

  Yaghubian, Arman R ^a   Hodgson, Thom J ^a   Joines, Jeffrey A ^a   Thomas Culbreth, C ^a   Huang, J C ^a  

^a North Carolina State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; FURNITURE MANUFACTURE; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; KILNS; LINEAR PROGRAMMING; MACHINERY; MATHEMATICAL MODELS; PROBLEM SOLVING;

DRY KILN; INTEGER LINEAR PROGRAM;

SCHEDULING;

EID: 0033363873     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1007602127881     Document Type: Article

References (28)

1. McNaughton, R. (1959) Scheduling with deadlines and loss functions. Management Science, 6(1), 1-12.
2. Dogramaci, A. (1984) Production scheduling of independent jobs on parallel identical processors. International Journal of Production Research, 22, 535-548.
3. Dogramaci, A. and Surkis, J. (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Management Science, 25, 1208-1216.
4. Root, J.G. (1965) Scheduling with deadlines and lost functions on k parallel machines. Management Science, 11, 460-475.
5. Arthanari, T.S. and Ramamurthi, K.G. (1970) A branch and bound algorithm for sequencing n jobs on m parallel processors. Opsearch, 7, 147-156.
6. Elmaghraby, S.E. and Park, S.H. (1974) Scheduling jobs on a number of identical machines. AUE Transactions, 6(1), 1-13.
7. Barnes, W.J. and Brennan, J.J. (1977) An improved algorithm for scheduling independent jobs on identical machines. AIIE Transactions, 9(1), 25-31.
8. 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.
9. 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, Université Claude Bernard, Villeurbanne, France.
10. Davis, E. and Jafle, J.M. (1981) Algorithms for scheduling tasks on unrelated processors. Journal of the Association for Computing Machinery, 28(4), 721-736.
11. [II] Elmaghraby, S.E. and Elimam, S.A. (1980) Knapsack-based approaches to the makespan problem on multiple processors. AIIE Transactions, 12(1), 87-96.
12. Graham, R.L. (1969) Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2), 416-429.
13. Hu, T.C. (1961) Parallel scheduling and assembly line problems. Operations Research, 9, 841-848.
14. Huang, J.C.-C. (1995) Decision support system for lumber procurement and dry kiln scheduling: a fuzzy system theory application. Industrial Engineering Department, Unpublished Ph.D. dissertation. North Carolina State University, Raleigh, NC.
15. Panwalkar, S.S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25, 45-61.
16. Potts, C.N. (1985) Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics, 10, 155-164.
17. Sahni, S. and Cho, Y. (1980) Scheduling independent tasks with due time on a uniform processor system. Journal of the Association for Computing Machinery, 27, 550-563.
18. Baker, K.R. and Su, Z.-S. (1974) Sequencing with due dates and early start times to minimize maximum tardiness. Naval Research Logistics Quarterly, 21, 171-176.
19. Blazewicz, J. (1987) Selected topics in scheduling theory. Annals of Discrete Mathematics, 31, 1-60.
20. Hall, N.G. and Rhee, W.T. (1986) Average and worst-case analysis of heuristics for the maximum tardiness problem. European Journal of Operational Research, 26, 272-211.
21. Labetoulle, J. (1984) Preemptive scheduling of uniform machines subject to release dates, in Process in Combinatorial Optimization, Pulleyblank, W.R. (ed.), Academic Press, New York.
22. Li, C.-L. and Lee, C.-Y. (1997) Scheduling with agreeable release times and due dates on a batch processing machine. European Journal of Operational Research, 96, 564-569.
23. Suresh, V. and Chaudhuri, D. (1994) Minimizing maximum tardiness for unrelated parallel machines. International Journal of Production Economics, 34, 223-229.
24. 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.
25. Suresh, V. and Chaudhuri, D. (1996) Scheduling of unrelated parallel machines when machine availability is specified. Production Planning and Control, 7(4), 393-400.
26. Lin, S. and Kernighan, B.W. (1973) An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21(2), 498-516.
27. Yaghubian, A.R. (1998) Decision support for dry kiln scheduling in the furniture industry: a local improvement heuristic approach. Unpublished Ph.D. dissertation, Industrial Engineering Department, North Carolina State University, Raleigh, NC.
28. Demirkol, E., Mehta, S. and Uzsoy, R. (1996) Benchmarking for shop scheduling problems. Technical Report, Industrial Engineering, Purdue University.