Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times

This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time an...

Full description

Saved in:
Bibliographic Details
Main Authors: CHEN, Changyu, FATHI, Madhi, KHAKIFIROOZ, Marzieh, WU, Kan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2022
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/6956
https://ink.library.smu.edu.sg/context/sis_research/article/7959/viewcontent/Hybrid_Tabu_Search_Algor_av.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-7959
record_format dspace
spelling sg-smu-ink.sis_research-79592023-07-19T07:27:52Z Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times CHEN, Changyu FATHI, Madhi KHAKIFIROOZ, Marzieh WU, Kan This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach and adopts a hybrid tabu search (TS) algorithm to acquire approximate feasible solutions. The MIP model has two phases and attempts to achieve the first two objectives. The hybrid TS algorithm has three phases and attempts to achieve all three objectives. In a real setting, computational results demonstrate that the maximum number of processed jobs can be acquired within a short time utilizing the hybrid TS algorithm (average 8 s). By comparing the two approaches, the TS outperforms the MIP model regarding solution quality and computational time for the second objective, minimizing the makespan. Furthermore, the third phase of the hybrid TS algorithm shows the effectiveness further to enhance the utilization of the ion implantation equipment. 2022-03-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/6956 info:doi/10.1016/j.cie.2021.107915 https://ink.library.smu.edu.sg/context/sis_research/article/7959/viewcontent/Hybrid_Tabu_Search_Algor_av.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Scheduling Unrelated parallel machines Setup times Expired times Job release Wafer fabrication Mixed integer programming Tabu search Operations Research, Systems Engineering and Industrial Engineering Theory and Algorithms
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Scheduling
Unrelated parallel machines
Setup times
Expired times
Job release
Wafer fabrication
Mixed integer programming
Tabu search
Operations Research, Systems Engineering and Industrial Engineering
Theory and Algorithms
spellingShingle Scheduling
Unrelated parallel machines
Setup times
Expired times
Job release
Wafer fabrication
Mixed integer programming
Tabu search
Operations Research, Systems Engineering and Industrial Engineering
Theory and Algorithms
CHEN, Changyu
FATHI, Madhi
KHAKIFIROOZ, Marzieh
WU, Kan
Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
description This research is motivated by a scheduling problem arising in the ion implantation process of wafer fabrication. The ion implementation scheduling problem is modeled as an unrelated parallel machine scheduling (UPMS) problem with sequence-dependent setup times that are subject to job release time and expiration time of allowing a job to be processed on a specific machine, defined as: R|rj,eij,STsd|Cmax. The objective is first to maximize the number of processed jobs, then minimize the maximum completion time (makespan), and finally minimize the maximum completion times of the non-bottleneck machines. A mixed-integer programming (MIP) model is proposed as a solution approach and adopts a hybrid tabu search (TS) algorithm to acquire approximate feasible solutions. The MIP model has two phases and attempts to achieve the first two objectives. The hybrid TS algorithm has three phases and attempts to achieve all three objectives. In a real setting, computational results demonstrate that the maximum number of processed jobs can be acquired within a short time utilizing the hybrid TS algorithm (average 8 s). By comparing the two approaches, the TS outperforms the MIP model regarding solution quality and computational time for the second objective, minimizing the makespan. Furthermore, the third phase of the hybrid TS algorithm shows the effectiveness further to enhance the utilization of the ion implantation equipment.
format text
author CHEN, Changyu
FATHI, Madhi
KHAKIFIROOZ, Marzieh
WU, Kan
author_facet CHEN, Changyu
FATHI, Madhi
KHAKIFIROOZ, Marzieh
WU, Kan
author_sort CHEN, Changyu
title Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
title_short Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
title_full Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
title_fullStr Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
title_full_unstemmed Hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
title_sort hybrid tabu search algorithm for unrelated parallel machine scheduling in semiconductor fabs with setup times, job release, and expired times
publisher Institutional Knowledge at Singapore Management University
publishDate 2022
url https://ink.library.smu.edu.sg/sis_research/6956
https://ink.library.smu.edu.sg/context/sis_research/article/7959/viewcontent/Hybrid_Tabu_Search_Algor_av.pdf
_version_ 1772829234923831296