Computing Idle Times in Fuzzy Flexible Job Shop Scheduling
The flexible job shop scheduling problem is relevant in many different areas. However, the usual deterministic approach sees its usefulness limited, as uncertainty plays a paramount role in real-world processes. Considering processing times in the form of fuzzy numbers is a computationally affordabl...
Saved in:
| Main Authors: | Pablo García Gómez, Inés González-Rodríguez, Camino R. Vela |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Algorithms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/18/3/137 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
job shop scheduling problem:literature review
by: Marrwa Abd-AlKareem Alabajee, et al.
Published: (2020-08-01) -
Minimum-Energy Scheduling of Flexible Job-Shop Through Optimization and Comprehensive Heuristic
by: Oludolapo Akanni Olanrewaju, et al.
Published: (2024-11-01) -
Improved Multiverse Optimization Algorithm for Fuzzy Flexible Job-Shop Scheduling Problem
by: Jin-Cheng Fang, et al.
Published: (2023-01-01) -
Application of Levy flight-based harmony search algorithm for the flexible job shop scheduling
by: Jun Li, et al.
Published: (2025-05-01) -
Solving multi-objective green flexible job-shop scheduling problem considering operation sequence flexibility
by: Najat Almasarwah
Published: (2025-12-01)