Open shop scheduling problems (OSSP) are highly significant in engineering and industry, involving critical scheduling challenges. The job type determines the duration required for material transfer between machines and remains unaffected by distance, eliminating any waiting time for transfers....

The Apparent Tardiness Cost (ATC) dispatching rule was initially developed to minimize tardiness in single-machine scheduling problems. ATC extensions have been frequently applied in other production settings, relying heavily on blocking idle machine capacity with a single-machine outlook; this...

Background: Additive manufacturing (AM) for patient-specific medical care products offers great opportunities. However, evidence about the supply chain (SC) performance impact based on empirical data is limited. Methods: In this case study, we gathered real-life data about a traditional...

Purpose: This paper investigates a batch scheduling problem where pre-processing is required for parts before processing, considering time-changing effects from part deterioration and operator learning-forgetting. Design/methodology/approach: A mathematical model was developed with the decision...

Purpose: This study aimed at implementing lean six sigma to evaluate the productivity and manufacturing waste in the production line of a paper company Methodology/Approach: The study is a case study in nature. The method illustrates how lean six sigma (LSS) is used to evaluate the existing...

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...

This paper investigates single machine scheduling problems with release time and random processing time, where the release time can be either deterministic or random. The objective is to determine a scheduling sequence that performs well in terms of out-of-sample performance. To achieve this, we...

The rapid growth of e-commerce in the recent pandemic is driven by the wide adoption of digitization, extensive use of smartphones, affordable internet services, and the convenience of shopping from anywhere and anytime. Some key indexes for measuring the performance of the e-commerce...

We present an approximation method for the hybrid flow shop scheduling problem based on relaxation and machine learning techniques. Our model combines a suitable relaxation of the objective function to a continuous solution space with a self-supervised learning method for neural networks, which...

In the present market scenario, it is seen that commodity is attracted by the stock of the items. Considering this fact in this present work, the demand for the item is considered as stock dependent in an inventory control system, where the items are deteriorating in nature. When the number of...

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...

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...

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...