Integrated heuristics for scheduling multiple order jobs in a complex job shop (Q538004): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1504/ijmheur.2010.034204 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2082290775 / rank | |||
Normal rank |
Latest revision as of 09:46, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Integrated heuristics for scheduling multiple order jobs in a complex job shop |
scientific article |
Statements
Integrated heuristics for scheduling multiple order jobs in a complex job shop (English)
0 references
23 May 2011
0 references
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.
0 references
job shop scheduling
0 references
constraint programming
0 references
ant colony optimisation
0 references
ACO
0 references
metaheuristics
0 references
hybrid algorithms
0 references