This paper deals with earliness and tardiness scheduling around common due dates and
windows. Related problems share a strong practical importance due to the endogenous and …

Scheduling with arbitrary due dates and no idle time permitted between jobs with the
objective of minimizing the total earliness and tardiness has a variety of industry …

The scheduling problems with controllable processing times (CPT) are commonly
encountered in some manufacturing industries. CPT means the processing times of …

Motivated by a practical production scheduling problem at a factory, this article studies
scheduling problems in seru production system (SPS). Seru is a relatively new‐type …

Truck scheduling coordinates the loading and unloading processes of trucks competing for
the timely processing at some terminal, eg, a cross-docking terminal or distribution center …

A steelmaking-continuous casting (SCC) scheduling problem is an example of complex
hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This …

Seru Production is widely used in the Japanese electronics industry owing to its benefits.
The total tardiness can be significantly reduced by Seru Production. We focus on …

With pervasive applications of new information technology, a larger number of
manufacturing big data is generated. This paper considers the unrelated parallel scheduling …

Using unrelated parallel machine scheduling to minimize the total earliness and tardiness of
jobs with distinct due dates is a nondeterministic polynomial-hard problem. Delayed …

The controllable processing times (CPTs) have many practical applications, enabling the
length of the job processing to vary within an interval flexibly with additional costs. In this …