Integrated heuristics for scheduling multiple order jobs in a complex job shop. (20th July 2010)

• Record Type: Journal Article
• Authors: Jampani, Jagadish; Pohl, Edward A.; Mason, Scott J.; Monch, Lars
• Is Part Of: International journal of metaheuristics. Volume 1:Number 2(2010)
• Page Start: 156
• Page End: 180
• Publication Date: 2010-07-20
• Subjects: job shop scheduling -- constraint programming -- ant colony optimisation -- ACO -- metaheuristics -- hybrid algorithms -- multiple order jobs -- semiconductor manufacturing -- wafer fabrication; Heuristic algorithms -- Periodicals; 006.3105
• Languages: English
• ISSNs: 1755-2176

Abstract

Scheduling in semiconductor manufacturing involves numerous types of complexities, including assignment of orders to front-opening unified pods (FOUPs), assignment of FOUPs to batches, and batch processing on single or parallel machines in multiple tool-groups with re-entrant flows. Based on these features, wafer fabrication in semiconductor manufacturing is referred to as a complex job shop in the literature. Assignment of multiple customer orders to jobs/FOUPs and scheduling them in a complex job shop environment is labelled as MOJ-CJSSP (multiple orders per job complex job shop scheduling problem). In this paper, we present constraint programming (CP), ant colony optimisation (ACO), and integrated CP-ACO approaches to minimise the sum of weighted completion times of the orders in MOJ-CJSSP.