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...
Guardado en:
Autores principales: | BongJoo Jeong, Jun-Hee Han, Ju-Yong Lee |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
MDPI AG
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/1ad67c6128af4c4b8d80aa3f94064284 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Penjadwalan Produksi Job shop Mesin Majemuk Menggunakan Algoritma Non Delay untuk Meminimalkan Makespan
por: Adhie Tri Wahyudi, et al.
Publicado: (2021) -
DESIGN OF A HYPERHEURISTIC FOR PRODUCTION SCHEDULING IN JOB SHOP ENVIRONMENTS
por: Castrillón,Omar Danilo, et al.
Publicado: (2010) -
Application of Mini-Batch Metaheuristic Algorithms in Problems of Optimization of Deterministic Systems with Incomplete Information about the State Vector
por: Andrei V. Panteleev, et al.
Publicado: (2021) -
Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds
por: Bonfim Amaro Junior, et al.
Publicado: (2021) -
Robust Fuzzy-Stochastic Programming Model and Meta-Heuristic Algorithms for Dual-Resource Constrained Flexible Job-Shop Scheduling Problem Under Machine Breakdown
por: Parham Soofi, et al.
Publicado: (2021)