Integrated heuristics for scheduling multiple order jobs in a complex job shop (Q538004): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / 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. | |||
Property / 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5898989 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
job shop scheduling | |||
Property / zbMATH Keywords: job shop scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
constraint programming | |||
Property / zbMATH Keywords: constraint programming / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ant colony optimisation | |||
Property / zbMATH Keywords: ant colony optimisation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
ACO | |||
Property / zbMATH Keywords: ACO / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
metaheuristics | |||
Property / zbMATH Keywords: metaheuristics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
hybrid algorithms | |||
Property / zbMATH Keywords: hybrid algorithms / rank | |||
Normal rank |
Revision as of 10:31, 1 July 2023
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