Integrated heuristics for scheduling multiple order jobs in a complex job shop
type: Item
instance of: scholarly article
title: Integrated heuristics for scheduling multiple order jobs in a complex job shop
zbMATH Open document ID: 1213.90119
DOI: 10.1504/IJMHEUR.2010.034204
author: Jagadish Jampani
author: Ed A. Pohl
author: Scott J. Mason
author: Lars Mönch
published in: International Journal of Metaheuristics
publication date: 2011-05-23T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5898989
zbMATH Keywords: job shop scheduling
zbMATH Keywords: constraint programming
zbMATH Keywords: ant colony optimisation
zbMATH Keywords: ACO
zbMATH Keywords: metaheuristics
zbMATH Keywords: hybrid algorithms
MaRDI profile type: Publication
full work available at URL: ijmheur.2010.034204
OpenAlex ID: W2082290775
description: scientific article; zbMATH DE number 5898989