Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review
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 …
windows. Related problems share a strong practical importance due to the endogenous and …
Integer programming formulations in sequencing with total earliness and tardiness penalties, arbitrary due dates, and no idle time: A concise review and extension
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 …
objective of minimizing the total earliness and tardiness has a variety of industry …
An effective multi-objective discrete virus optimization algorithm for flexible job-shop scheduling problem with controllable processing times
The scheduling problems with controllable processing times (CPT) are commonly
encountered in some manufacturing industries. CPT means the processing times of …
encountered in some manufacturing industries. CPT means the processing times of …
An exact quadratic programming approach based on convex reformulation for seru scheduling problems
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 …
scheduling problems in seru production system (SPS). Seru is a relatively new‐type …
Integrated truck and workforce scheduling to accelerate the unloading of trucks
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 …
the timely processing at some terminal, eg, a cross-docking terminal or distribution center …
A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex
hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This …
hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This …
Reducing the total tardiness by Seru production: model, exact and cooperative coevolution solutions
W Sun, Y Yu, Q Lou, J Wang, Y Guan - International Journal of …, 2020 - Taylor & Francis
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 …
The total tardiness can be significantly reduced by Seru Production. We focus on …
Unrelated parallel machine scheduling problem with energy and tardiness cost
Z Li, H Yang, S Zhang, G Liu - The International Journal of Advanced …, 2016 - Springer
With pervasive applications of new information technology, a larger number of
manufacturing big data is generated. This paper considers the unrelated parallel scheduling …
manufacturing big data is generated. This paper considers the unrelated parallel scheduling …
Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control
CY Cheng, LW Huang - Journal of manufacturing systems, 2017 - Elsevier
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 …
jobs with distinct due dates is a nondeterministic polynomial-hard problem. Delayed …
Unrelated parallel machine scheduling problem with special controllable processing times and setups
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 …
length of the job processing to vary within an interval flexibly with additional costs. In this …