A Robust Heuristics for the Online Job Shop Scheduling Problem

A Robust Heuristics for the Online Job Shop Scheduling Problem

The job shop scheduling problem (JSSP) is a popular NP-hard problem in combinatorial optimization, due to its theoretical appeal and its importance in applications. In practical applications, the online version is much closer to the needs of smart manufacturing in Industry 4.0 and 5.0. Here, the onl...

Full description

Saved in:
Bibliographic Details
Main Authors: Hugo Zupan, Niko Herakovič, Janez Žerovnik
Format: Article
Language:English
Published: MDPI AG 2024-12-01
Series:Algorithms
Subjects:
job shop scheduling problem
online algorithm
heuristics
simulation
digital twin
smart manufacturing
Online Access:https://www.mdpi.com/1999-4893/17/12/568
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items