Stolyar and Wang (2021) provide a proof-of-concept that randomness of lead times in inventory systems can be exploited to achieve large - potentially unlimited - performance improvements, compared to the case of constant lead time. In this paper we explore what improvements are actually...

Scheduling problems occur in a broad range of real-world application fields and have attracted a huge set of research articles. However, there is only little research on exact algorithms for scheduling problems, many of which are NP-hard in the strong sense. We investigate the problem on a...

To solve the technician scheduling problem, this paper establishes a technician scheduling model considering the task release time, and designs a branch delimitation algorithm to solve the problem accurately by fully utilizing each technician's skills and allocating limited human resources to...

There is a lack of research on flexible job shop scheduling problem (FJSP) considering limited fixture-pallet resources in multi-product mixed manufacturing workshop. However, field research in a leading engine manufacturer in China has revealed that fixture-pallet resources are a key factor...

Inventory models with lost sales and large lead times are notoriously difficult to manage due to the curse of dimensionality. Recently, Goldberg et al. (2016) and Xin and Goldberg (2016) proved that in the lost-sales inventory model with divisible products, as the lead time grows large, a simple...