An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups

European Journal of Operational Research

Volumn 109, Issue 1, 1998, Pages 142-159

  Kolahan, F ^a   Liang, M ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Adaptive neighbourhood generation; Job sequencing; Just in time production; Tabu search; Variable processing time

Indexed keywords

EID: 0042354194     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00098-2     Document Type: Article

References (23)

1. B. Adenso-Diaz, Restricted neighbourhood in the tabu search for the flowshop problem, European Journal of Operational Research 62 (1992) 27-37.
2. K.R. Baker, G.D. Scudder, Sequencing with earliness and tardiness penalties: A review, Operations Research 38 (1) (1990) 22-36.
3. T.C.E. Cheng, Z.L. Chen, L. Chung, Parallel-machine scheduling with controllable processing times, IIE Transactions 28 (1996) 177-180.
4. T.C.E. Cheng, M.C. Gupta, Survey of scheduling research involving due date determination decisions, European Journal of Operational Research 38 (1989) 156-166.
5. H.A.J. Crauwels, C.N. Potts, L.N. Wassenhove, Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs, European Journal of Operational Research 90 (1996) 200-213.
6. R.L. Daniel, R.K. Sarin, Single machine scheduling with controllable processing times and number of jobs tardy, Operations Research 37 (6) (1989) 981-984.
7. F. Della Croce, Generalized pairwise interchanges and machine scheduling, European Journal of Operational Research 83 (1995) 310-319.
8. E.A. Elsayed, M.-K. Lee, S. Kim, E. Scherer, Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals, International Journal of Production Research 31 (3) (1993) 727-738.
9. J.R., Evans, D.R. Anderson, D.J. Sweeney, T.A., Williams, Applied Production and Operations Management, West Publishing Company, New York, 1990.
10. M.R. Garey, R.E. Tarjan, G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research 13 (2) (1988) 330-348.
11. F. Glover, Future paths for integer programming and links to artificial intelligence, Computers and Operations Research 13 (1986) 533-549.
12. F. Glover, Tabu search: A tutorial, Interfaces 20 (4) (1990) 74-94.
13. S.K. Gupta, J. Kyparisis, Single machine scheduling research, Omega 15 (3) (1987) 207-227.
14. R. Hubscher, F. Glover, Applying tabu search with influential diversification to multiprocessor scheduling, Computers and Operations Research 21 (8) (1994) 877-884.
15. J. Knox, Tabu search performance on the symmetric travelling salesman problem, Computers and Operations Research 21 (8) (1994) 867-874.
16. I. Lee, Single machine scheduling with controllable processing times: A parametric study. International Journal of Production Economics 22 (2) (1991) 105-110.
17. C.Y. Lee, S.J. Kim, Parallel genetic algorithms for the earliness-tardiness job scheduling problem with general penalty weights, Computers and Industrial Engineering 28 (2) (1995) 231-243.
18. J.K. Lenstra, A.H.G. Rinnoy, P. Brucker, Complexity of machine scheduling problems, Annals of Discrete Mathematics 1 (1977) 343-362.
19. C. Oguz, C. Dincer, Single machine earliness-tardiness scheduling problems using the equal-slack rule, Journal of Operational Research Society 45 (5) (1994) 589-594.
20. S.C. Sarin, E. Erel, G. Steiner, Sequencing jobs on a single machine with common due date and stochastic processing times, European Journal of Operational Research 51 (2) (1991) 188-198.
21. R.G. Vickson, Two single machine sequencing problems involving controllable job processing times, AIIE Transactions 12 (3) (1980) 258-262.
22. H.K.B. William, Experimental investigation of intelligent search methods for job scheduling, Ph.D. Dissertation, Faculty of Operations Management, Georgia Institute of Technology, 1994.
23. D.L. Woodruff, Simulated annealing and tabu search: Lessons from a line search, Computers and Operations Research 21 (8) (1994) 829-831.