Fuzzy job-shop scheduling problems (Fuzzy JSSPs) are a class of combinational
optimization problems known as non-deterministic polynomial-hard problems. In recent …

Over the past several decades, interest in metaheuristic approaches to address job-shop
scheduling problems (JSSPs) has increased due to the ability of these approaches to …

Based on the analysis of the differences and relations between traditional and data-based
scheduling methods for complex manufacturing systems, a data-based scheduling …

This paper introduces novel heuristics for the resolution of the single machine problem with
total weighted tardiness by combining data mining and genetic algorithms. The aim of this …

Scheduling is a crucial problem appearing in various domains, such as manufacturing,
transportation, or healthcare, where the goal is to schedule given operations on available …

In this paper we focus on the Job Shop Scheduling Problem (JSSP) using Priority
Dispatching Rules. Simulation model for makespan optimization is proposed using different …

Identifying the best Dispatching Rule in order to minimize makespan in a Job Shop
Scheduling Problem is a complex task, since no Dispatching Rule is better than all others in …

In manufacturing system, there usually have been some unpredictable dynamic events,
which would make the production scheme invalid. Therefore, it's necessary to inject some …

Scheduling job shops in the real-world manufacturing environment is a multifarious task that
involved various and multiple components, solutions and approach. Fuzzy Job-Shop …

This paper addresses the job shop scheduling problem in the presence of machine
breakdowns. In this work, we propose to exploit the advantages of data mining techniques to …