An Extensive Tabu Search Algorithm for Solving the Lot Streaming Problem in a Job Shop Environment

Liji Shen ()
Additional contact information
Liji Shen: Dresden University of Technology

A chapter in Operations Research Proceedings 2007, 2008, pp 49-54 from Springer

Abstract: Abstract The purpose of this paper is to solve the lot streaming problem in job shop scheduling systems, where both equal and consistent sublots are considered. The presented algorithm incorporates a tabu search procedure to determine schedules and a specific heuristic for improving sublot sizes. Computational results confirm that, by applying the lot streaming strategy, production can be significantly accelerated. Moreover, this algorithm yields superior solutions compared to various approaches proposed in the literature and all tested instances show a rapid convergence to their lower bounds.

Keywords: Lot Streaming; Job Shop; Tabu Search (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-77903-2_8

Ordering information: This item can be ordered from
http://www.springer.com/9783540779032

DOI: 10.1007/978-3-540-77903-2_8

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().