We review dynamic programming (DP) algorithms utilized to solve offline deterministic
single-machine scheduling problems. We classify DP algorithms based on problem …

In today's complex business environment, the optimisation of operational processes is an
essential factor for the survival of organisations. Many companies struggling to maintain …

In the classic distributed permutation flowshop scheduling problem (DPFSP), there are more
studies on the minimization of makespan, total flow time, total tardiness, etc. This paper …

This paper considers a novel single-stage scheduling problem with jobs being delivered in
batches on flexibly definable customer-dependent delivery dates. To be applicable to real …

We consider an integrated production and transportation scheduling problem arising in
several make-to-order settings, where customer orders have release times and pre-specified …

We consider several integrated production, inventory, and delivery problems that arise in a
number of practical settings where customer orders have pre-specified delivery time …

This paper analyzes the permutation flow‐shop problem with delivery dates and cumulative
payoffs (whenever these dates are met) under uncertainty conditions. In particular, the paper …

Lot streaming technology enables continuous overlapping operations, which is of great
significance in shortening production cycles, reducing unnecessary waiting time, and …

This study considers an integrated production, inventory, and outbound distribution
scheduling model that arises in a three-stage supply chain consisting of three parts: a …

This paper addresses the problem of minimizing the total tardiness of a set of jobs to be
scheduled on identical parallel machines where jobs can only be delivered at certain fixed …