Scenario-based multi-objective robust scheduling for a semiconductor production line

Liu, Juan; Qiao, Fei; Kong, Weichang

doi:10.1080/00207543.2019.1641234

Cited by 18 publications

(4 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other fields, some researchers apply the scenario-based method to solve a stochastic multi-objective model [ 44 , 45 , 46 ]. A multi-objective optimization problem under uncertainty in transmission expansion planning was proposed in [ 47 ].…”

Section: Related Workmentioning

confidence: 99%

A Bi-Objective Home Health Care Routing and Scheduling Problem under Uncertainty

Zhao,

Wang,

Monteiro

2024

IJERPH

View full text Add to dashboard Cite

Home health care companies provide health care services to patients in their homes. Due to increasing demand, the provision of home health care services requires effective management of operational costs while satisfying both patients and caregivers. In practice, uncertain service times might lead to considerable delays that adversely affect service quality. To this end, this paper proposes a new bi-objective optimization problem to model the routing and scheduling problems under uncertainty in home health care, considering the qualification and workload of caregivers. A mixed-integer linear programming formulation is developed. Motivated by the challenge of computational time, we propose the Adaptive Large Neighborhood Search embedded in an Enhanced Multi-Directional Local Search framework (ALNS-EMDLS). A stochastic ALNS-EMDLS is introduced to handle uncertain service times for patients. Three kinds of metrics for evaluating the Pareto fronts highlight the efficiency of our proposed method. The sensitivity analysis validates the robustness of the proposed model and method. Finally, we apply the method to a real-life case and provide managerial recommendations.

show abstract

Section: Related Workmentioning

confidence: 99%

A Bi-Objective Home Health Care Routing and Scheduling Problem under Uncertainty

Zhao,

Wang,

Monteiro

2024

IJERPH

View full text Add to dashboard Cite

show abstract

“…In the case of the enterprise that needs to quickly satisfy the various production requirements of customers, minimizing the flow time may be appropriate to achieve the goal of the enterprise. Therefore, in the real-world semiconductor packaging facilities, it is a common practice to optimize the weighted sum of the two objectives according to the given situation [10].…”

Section: Introductionmentioning

confidence: 99%

A Generation and Repair Approach to Scheduling Semiconductor Packaging Facilities Using Case-Based Reasoning

Park

Huh²,

Park

2023

IEEE Access

View full text Add to dashboard Cite

As the demand for multi-chip products with high capacity and small size increases, semiconductor packaging facilities have been faced with complicated constraints such as re-entrant flows, sequence dependent setups, and alternative routes, which leads to difficulties in scheduling semiconductor manufacturing operations. Furthermore, due to the frequent variations in the relative importance between objectives as well as the variabilities in initial setup status, available machines, and production requirements, practitioners are obliged to obtain a schedule within a short amount of computation time. In this paper, we propose a novel two-phase framework that aims to quickly produce a schedule of semiconductor packaging facilities by using case-based reasoning for minimizing the weighted sum of machine loss time and waiting time of jobs. Specifically, in the case generation phase, a case database is constructed by solving case scheduling problems using an existing solver. The case reasoning phase is responsible for repairing operation type sequences in the cases to produce a schedule for an unseen scheduling problem whose production requirements, available machines, initial setup status, and weight between performance measures are different from those of cases. The extensive experimental results demonstrated that the proposed approach requires a short computation time similar to the rule-based methods while maintaining the quality of the schedules comparable to that of the existing metaheuristics.INDEX TERMS Semiconductor packaging facilities, flexible job shop scheduling, case-based reasoning, sequence dependent setups, schedule repair.

show abstract

“…e semiconductor manufacturing environment can be regarded as one of the most complicated production processes and usually operates hundreds of machines. Moreover, Liu et al [1] stated that there are approximately 400 process operations in the process flow and the processing cycle may last for several months. To gain a competitive edge in semiconductor manufacturing, the enterprises intend to shorten the cycle time, reduce the production costs, and improve the quality by executing effective controls on the production process.…”

Section: Introductionmentioning

confidence: 99%

The Dynamic Flow Shop Scheduling Problem with JIT Philosophy and Common Due Date

Huang

Chen

Chen³

et al. 2022

Mathematical Problems in Engineering

View full text Add to dashboard Cite

Most studies on common due date problems discuss the topic in the context of solving the minimum penalty value for the single-machine or parallel machine scheduling environment. This study extends the problem of the common due date to the dynamic flow shop environment and proposes the enhanced heuristic algorithm to solve the minimum penalty value. The enhanced heuristic algorithm is characterized by designating mutant genomes of the child as the genomes located at the central location before mutation. The advantage is to integrate the successful experiences of the conventional common due date algorithm to improve the efficiency of the proposed heuristic algorithm. The performance of both algorithms is analyzed in terms of uniformly distributed job numbers, processing time, early penalty, and late penalty. The resulting outcomes indicate that the enhanced heuristic algorithm outperforms the conventional CDDA and EDD proposed by previous studies in the average penalties.

show abstract

Scenario-based multi-objective robust scheduling for a semiconductor production line

Cited by 18 publications

References 31 publications

A Bi-Objective Home Health Care Routing and Scheduling Problem under Uncertainty

A Bi-Objective Home Health Care Routing and Scheduling Problem under Uncertainty

A Generation and Repair Approach to Scheduling Semiconductor Packaging Facilities Using Case-Based Reasoning

The Dynamic Flow Shop Scheduling Problem with JIT Philosophy and Common Due Date

Contact Info

Product

Resources

About