Batch-processing machines (BPMs) can process a number of jobs at a time, which can be
found in many industrial systems. This article considers a single BPM scheduling problem …

The flexible job shop scheduling problem (FJSP) is considered as an important problem in
the modern manufacturing system. It is known to be an NP-hard problem. Most of the …

This work proposes a unified heuristic algorithm for a large class of earliness–tardiness (E–
T) scheduling problems. We consider single/parallel machine E–T problems that may or may …

Order management is a critical and complicated issue in the production process of iron and
steel industry, since orders are the bridge between customers and semi-finished/final …

Increasing costs of energy and environmental pollution is prompting scholars to pay close
attention to energy-efficient scheduling. This study constructs a multi-objective model for the …

Single machine total weighted tardiness problem (SMTWTP) is one of the fundamental
combinatorial optimization problems. The problem consists of a set of independent jobs with …

An evolutionary discrete firefly algorithm (EDFA) is presented herein to solve a real‐world
manufacturing system problem of scheduling a set of jobs on a single machine subject to …

This paper investigates the problem of single-machine scheduling with sequence-
dependent setup times for minimizing the total weighted tardiness of jobs. Because the …

The objective of this research is to study the one machine scheduling problem with setup-
times. Two objectives were considered; the completion time and the total weighted …

The flexible job shop scheduling problem (FJSP) is considered as an important problem in
the modern manufacturing system. It is known to be an NP-hard problem. Most of the …