An integrated tabu search algorithm for the lot streaming problem in job shops

European Journal of Operational Research

Volumn 199, Issue 2, 2009, Pages 385-399

  Buscher, Udo ^a   Shen, Liji ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Lot streaming techniques; Tabu search; The job shop problem

Indexed keywords

BENCH-MARK PROBLEMS; JOB SHOP ENVIRONMENTS; JOB SHOPS; LOT STREAMING TECHNIQUES; LOWER BOUNDS; MAKESPAN; MULTI LEVELS; NEIGHBOURHOOD; RAPID CONVERGENCES; SPECIFIC COMPONENTS; TABU SEARCH ALGORITHMS; THE JOB SHOP PROBLEM;

CONTROL THEORY; LEARNING ALGORITHMS; SIMULATED ANNEALING; STREAM FLOW;

TABU SEARCH;

EID: 67349121274     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.11.046     Document Type: Article

References (22)

1. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 (1988) 391-401
2. Applegate D., and Cook W. A computational study of the job-shop scheduling problem. ORSA Journal on Computing 3 (1990) 149-156
3. Baker K. Lot streaming in the two-machine flow shop with setup times. Annals of Operations Research 57 (1995) 1-11
4. Battiti R., and Giampietro T. The reactive tabu search. ORSA Journal on Computing 6 2 (1994) 126-140
5. Buscher, U., Shen, L., 2007. An Integer Programming Formulation for the Lot Streaming Problem in a Job Shop Environment with Setups. vol. 126, Department of Business Administration and Economics, Dresden University of Technology, Working Paper, March.
6. Chen J., and Steiner G. Lot streaming with attached setups in three-machine flow shops. IIE Transactions 30 (1998) 1075-1084
7. Dauzère-Pérès S., and Lasserre J. A modified shifting bottleneck procedure for job-shop scheduling. International Journal of Production Research 31 (1993) 923-932
8. Dauzère-Pérès S., and Lasserre J. Lot streaming in job-shop scheduling. Operations Research 45 (1997) 584-595
9. Dellamico M., and Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 41 (1993) 231-252
10. Fisher H., and Thompson G. Probabilistic learning combinations of local job-shop scheduling rules. In: Muth J., and Thompson G. (Eds). Industrial Scheduling (1963), Prentice Hall, Englewood Cliffs, New Jersey
11. Glass C., and Potts C. Structural properties of lot streaming in a flow shop. Mathematical Methods of Operations Research 23 (1998) 624-639
12. Glover F., Kelly J., and Laguna M. Genetic algorithms and tabu search: Hybrids for optimization. Computers and Operations Research 22 (1995) 111-134
13. Laarhoven P.V., Aarts E., and Lenstra J. Job shop scheduling by simulated annealing. Operations Research 40 (1992) 113-125
14. Lawrence, S., 1984. Resource Constrained project scheduling: An experimental investigation of heuristic scheduling techniques (Supplement). Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA.
15. Low C., Hsu C., and Huang K. Benefits of lot splitting in job-shop scheduling. International Journal of Advanced Manufacturing Technology 24 (2004) 773-780
16. Murovec B., and Suhel P. A repairing technique for the local search of the job-shop problem. European Journal of Operational Research 153 (2004) 220-238
17. Nowicki E., and Smutnicki C. A fast taboo search algorithm for the job shop problem. Management Science 42 6 (1996) 797-813
18. Potts C., and Baker K. Flow shop scheduling with lot streaming. Operations Research Letters 8 (1989) 297-303
19. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
20. Taillard E. Parallel taboo search techniques for the job shop scheduling problem. ORSA Journal on Computing 6 (1994) 108-117
21. Tseng C., and Liao C. A discrete particle swarm optimization for lot-streaming flowshop scheduling problem. European Journal of Operational Research 191 (2008) 360-373
22. Vaessens R., Aarts E., and Lenstra J. Job shop scheduling by local search. INFORMS Journal on Computing 8 3 (1996) 302-317