Job shop scheduling problem (JSSP) is a thriving area of scheduling research, which has
been concerned and studied widely by scholars in engineering and academic fields. This …

One of the basic scheduling problems, the open-shop scheduling problem has a broad
range of applications across different sectors. The problem concerns scheduling a set of …

In this study, we propose an efficient optimization algorithm that is a hybrid of the iterated
greedy and simulated annealing algorithms (hereinafter, referred to as IGSA) to solve the …

Datasets comprise a collection of features; however, not all of these features may be
necessary. Feature selection is the process of identifying the most relevant features while …

In many practical manufacturing systems, transportation equipment such as automated
guided vehicles (AGVs) is widely adopted to transfer jobs and realize the collaboration of …

Since the energy waste of manufacturing industries exacerbates pollution emissions and
directly affects the environment, the energy efficiency optimization of the production process …

Due to the involvement of workers, scheduling production jobs necessitates consideration of
worker shifts in most production activities. In this study, we address a flexible job shop …

This work focuses on a new flexible scheduling problem in the job-shop that considers both
maintenance activity and repairman competence under maintenance time window and …

In this study, a novel and computationally efficacious Parallel Two-Step Decomposition-
Based Heuristic (PTSDBH) and a Mixed Integer Linear Programming (MILP) are developed …

Since greening scheduling is arousing increasing attention from many manufacturing
enterprises, this paper focuses on a flexible job shop greening scheduling problem with …