Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to minimize a weighted sum of total tardiness of u...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	BongJoo Jeong, Jun-Hee Han, Ju-Yong Lee
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	scheduling flow shop urgent jobs limited waiting times metaheuristic Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/1ad67c6128af4c4b8d80aa3f94064284
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:1ad67c6128af4c4b8d80aa3f94064284
record_format	dspace
spelling	oai:doaj.org-article:1ad67c6128af4c4b8d80aa3f940642842021-11-25T16:13:11ZMetaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times10.3390/a141103231999-4893https://doaj.org/article/1ad67c6128af4c4b8d80aa3f940642842021-11-01T00:00:00Zhttps://www.mdpi.com/1999-4893/14/11/323https://doaj.org/toc/1999-4893This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to minimize a weighted sum of total tardiness of urgent jobs and the makespan of normal jobs. This problem is formulated in mixed integer programming (MIP). By using a commercial optimization solver, the MIP can be used to find an optimal solution. However, because this problem is proved to be NP-hard, solving to optimality requires a significantly long computation time for a practical size problem. Therefore, this study adopts metaheuristic algorithms to obtain a good solution quickly. To complete this, two metaheuristic algorithms (an iterated greedy algorithm and a simulated annealing algorithm) are proposed, and a series of computational experiments were performed to examine the effectiveness and efficiency of the proposed algorithms.BongJoo JeongJun-Hee HanJu-Yong LeeMDPI AGarticleschedulingflow shopurgent jobslimited waiting timesmetaheuristicIndustrial engineering. Management engineeringT55.4-60.8Electronic computers. Computer scienceQA75.5-76.95ENAlgorithms, Vol 14, Iss 323, p 323 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	scheduling flow shop urgent jobs limited waiting times metaheuristic Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95
spellingShingle	scheduling flow shop urgent jobs limited waiting times metaheuristic Industrial engineering. Management engineering T55.4-60.8 Electronic computers. Computer science QA75.5-76.95 BongJoo Jeong Jun-Hee Han Ju-Yong Lee Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
description	This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to minimize a weighted sum of total tardiness of urgent jobs and the makespan of normal jobs. This problem is formulated in mixed integer programming (MIP). By using a commercial optimization solver, the MIP can be used to find an optimal solution. However, because this problem is proved to be NP-hard, solving to optimality requires a significantly long computation time for a practical size problem. Therefore, this study adopts metaheuristic algorithms to obtain a good solution quickly. To complete this, two metaheuristic algorithms (an iterated greedy algorithm and a simulated annealing algorithm) are proposed, and a series of computational experiments were performed to examine the effectiveness and efficiency of the proposed algorithms.
format	article
author	BongJoo Jeong Jun-Hee Han Ju-Yong Lee
author_facet	BongJoo Jeong Jun-Hee Han Ju-Yong Lee
author_sort	BongJoo Jeong
title	Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
title_short	Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
title_full	Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
title_fullStr	Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
title_full_unstemmed	Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times
title_sort	metaheuristics for a flow shop scheduling problem with urgent jobs and limited waiting times
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/1ad67c6128af4c4b8d80aa3f94064284
work_keys_str_mv	AT bongjoojeong metaheuristicsforaflowshopschedulingproblemwithurgentjobsandlimitedwaitingtimes AT junheehan metaheuristicsforaflowshopschedulingproblemwithurgentjobsandlimitedwaitingtimes AT juyonglee metaheuristicsforaflowshopschedulingproblemwithurgentjobsandlimitedwaitingtimes
_version_	1718413242188955648

Metaheuristics for a Flow Shop Scheduling Problem with Urgent Jobs and Limited Waiting Times

Ejemplares similares