NDLI: Difference priority algorithm in semiconductor scheduling problems

Content Provider	IEEE Xplore Digital Library
Author	Yu, K.M. Lee, M.G. Lee, C.H. Chen, Y.Y.
Copyright Year	2013
Description	Author affiliation: Dept. of Leisure Recreation & Manage., Chung Hua Univ., Hsinchu, Taiwan (Lee, M.G.) \|\| Dept. of Comput. Sci. & Inf. Eng., Chung Hua Univ., Hsinchu, Taiwan (Yu, K.M.; Lee, C.H.; Chen, Y.Y.)
Abstract	The semiconductor industry is one kind of capital intense industry. To establish a new professional testing company, the budget for machines is almost 90% of the whole company's expense, and it can be amortized within 5 years only. Thus, how to improve the efficiency and effectiveness of the testing procedure is one of the most important issues for a semiconductor testing company. In this paper, the algorithm MDP-GA is proposed which is a hybrid algorithm of the difference-priority and genetic algorithms (GA). It emphasizes on accelerating the converging process and improves quality of solution obtained. The converging process can be completed within a short time, and the solution will not converge to a local optimized solution. In order to investigate the performance of the MDP-GA, some experiments under the best condition and three different cases are designed for simulation. The numerical results are compared with results from GATS (the hybrid algorithms of GA with Tabu search). From the outputs of the experiments by the MDP-GA and the GATS, the average completion time of the MDP-GA outperforms the GATS. On the best condition, the production rate can raise up to 270%~1000% by the MDP-GA.
Starting Page	1545
Ending Page	1549
File Size	1531342
Page Count	5
File Format	PDF
ISBN	9781479909865
DOI	10.1109/IEEM.2013.6962669
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-12-10
Publisher Place	Thailand
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Job shop scheduling Processor scheduling The flexible flow-shop scheduling (FFSP) time of task accomplished (TTA) Biological cells Gene Algorithm (GA) Genetic algorithms Testing Tabu search algorithm
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A Genetic Algorithm and Tabu Search for Multi Objective Flexible Job Shop Scheduling Problems

A Genetic Algorithm and Tabu Search for Solving Flexible Job Shop Schedules

A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems

Applying genetic local search to solve the Flexible Job-shop Scheduling Problem

Solving fuzzy flexible job shop scheduling problems using genetic algorithm

A hybrid based GA and HS algorithms in blocking flow shop scheduling problems

Diversifying TS using GA in multi-agent system for solving Flexible Job Shop Problem

Parallel tabu search algorithm for the permutation flow shop problem with criterion of minimizing sum of job completion times

Combining Tabu Search and Genetic Algorithm in a Multi-agent System for Solving Flexible Job Shop Problem

Difference priority algorithm in semiconductor scheduling problems

Similar Documents

A Genetic Algorithm and Tabu Search for Multi Objective Flexible Job Shop Scheduling Problems

A Genetic Algorithm and Tabu Search for Solving Flexible Job Shop Schedules

A harmony search algorithm for hybrid flow shop scheduling with multiprocessor task problems

Applying genetic local search to solve the Flexible Job-shop Scheduling Problem

Solving fuzzy flexible job shop scheduling problems using genetic algorithm

A hybrid based GA and HS algorithms in blocking flow shop scheduling problems

Diversifying TS using GA in multi-agent system for solving Flexible Job Shop Problem

Parallel tabu search algorithm for the permutation flow shop problem with criterion of minimizing sum of job completion times

Combining Tabu Search and Genetic Algorithm in a Multi-agent System for Solving Flexible Job Shop Problem

Difference priority algorithm in semiconductor scheduling problems