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

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

A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...

A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...