Scheduling of Single Machine with Release Date to Minimize Multiple Objective Functions

2nd International Scientific Conference (Pure Sciences, Brilliant Creativity and Renewed Building)

Cheachan, Hanan A.^1 ; Ibrhim, Manal H.^2 ; Mohammed, Hussam A.A.^2

Department of Mathematics, College of Sciences, University of Mustansiriyah, Baghdad, Iraq^1

Department of Mathematics, College of Education for Pure Sciences, University of Kerbala, Kerbala, Iraq^2

关键词: Computational experiment;    Descent method;    Lower bounds;    Multiple objective functions;    Near-optimal solutions;    Simulation Acceptance Method;    Single- machines;    Single-machine scheduling;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/571/1/012003/pdf
DOI  :  10.1088/1757-899X/571/1/012003

来源: IOP

【 摘 要 】

The aim of this paper is to derive several upper bounds and a lower bound, these bounds to be used in a branch and bound method. Because of the computational complexity of the our problem, optimal and near-optimal solutions are obtained by developed algorithms. All algorithms are tested and computational experiments is given in tables.