This study investigates an NP-hard parallel machine scheduling problem, a critical challenge in manufacturing, healthcare, and logistics industries where efficient resource allocation is essential. The issue involves scheduling operations where each task requires an additional resource, with...

Background: Foundational research on the gamma distribution and inventory control highlighted its flexibility and practicality for managing fast-moving finished goods. Nonetheless, concerns remain about conventional statistical approximations of lead-time demand (LTD) distributions. Real-world...

This paper studies the simultaneous minimization of total weighted earliness-tardiness (TWET) and makespan in a just-in-time single-machine scheduling problem (JIT-SMSP) with sequence-dependent setup times and distinct due windows, allowing idle times in the schedules. Multiple variants of...

The role of setup times in production planning and control was recognised in the late 1960s. Since then, a growing number of scheduling problems have accounted for sequence-dependent setup time variables. This study aims to provide a systematic review of setup times in the short-term production...

Background: In Engineer-to-Order (EtO) supply chains, managing supplier lead times is particularly challenging due to high customization and intensive customer involvement. This study addresses the critical need for more accurate and dynamic lead time prediction to enhance supply chain...

This research focuses on modeling and solving a bi-objective hybrid flow shop scheduling problem, considering uncertain job-dependent setup times and worker constraints. The main objective of the mathematical model is to simultaneously minimize the Maximum Completion Time (Cmax) and minimize the...

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

This study presents a production scheduling for unrelated parallel machines with machine and job sequence-dependent setup times. The system performance measures to minimize include makespan, total tardiness, and number of tardy jobs. The aim of the study is to develop a solution methodology that...

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

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

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

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

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