Theoretical approaches and special cases for a single machine with release dates to minimize four criterion

Document Type : Research Paper


Department of Mathematics, College of Sciences, Al-Mustansireah University, Baghdad, Iraq


We propose a multi-objective machine scheduling problem (MSP) in this study. The sum of total flow time, total tardiness, total earliness, and total late work is the topic under discussion. With an arbitrary release date, This paper offers a theoretical analysis, discussion, and proofs for a number of special instances that apply to our topic.