DocumentCode
2121904
Title
Scheduling batch processing machines in complex job shops
Author
Oey, Kasin ; Mason, Scott J.
Author_Institution
Dept. of Ind. Eng., Arkansas Univ., Fayetteville, AR, USA
Volume
2
fYear
2001
fDate
2001
Firstpage
1200
Abstract
This paper considers a complex job shop problem with reentrant flow and batch processing machines. A modified shifting bottleneck heuristic (MSB) is considered for generating machine schedules to minimize the total weighted tardiness. We observe that the MSB could produce infeasible schedules where cyclic schedules are found. A cycle elimination procedure is proposed to remove the possibility of the MSB generating cyclic schedules in the solution
Keywords
batch processing (industrial); flow graphs; integrated circuit manufacture; production control; complex job shop problem; cycle elimination procedure; cyclic schedules; disjunctive graph; machine schedules; modified shifting bottleneck heuristic; reentrant flow; scheduling batch processing machines; semiconductor manufacturing; total weighted tardiness minimization; Boron; Conductors; Customer satisfaction; Industrial engineering; Job shop scheduling; Manufacturing industries; Marketing and sales; Semiconductor device manufacture; Semiconductor device reliability; Silicon;
fLanguage
English
Publisher
ieee
Conference_Titel
Simulation Conference, 2001. Proceedings of the Winter
Conference_Location
Arlington, VA
Print_ISBN
0-7803-7307-3
Type
conf
DOI
10.1109/WSC.2001.977434
Filename
977434
Link To Document