MULTIPLE OBJECTIVE FUNCTION ON A SINGLE MACHINE SCHEDULING
We consider a single machine scheduling problem to minimize a multiple objective function; sum of earliness, tardiness and completion time. As this problem is complete NP-hard we propose a branch and bound algorithm to obtain an optimal solution. The implementation of optimizing algorithms dose see...
Main Authors: | Abdul Razaq T. S. . S, Al Saidy S. K. K, Al Zuwaini M. K |
---|---|
Format: | Article |
Language: | English |
Published: |
Faculty of Computer Science and Mathematics, University of Kufa
2010-04-01
|
Series: | Journal of Kufa for Mathematics and Computer |
Subjects: | |
Online Access: | https://journal.uokufa.edu.iq/index.php/jkmc/article/view/12761 |
Similar Items
-
BASA: An improved hybrid bees algorithm for the single machine scheduling with early/tardy jobs
by: Ahmed Adnane Abdessemed, et al.
Published: (2023-07-01) -
Approximation of the Objective Function of Single-Machine Scheduling Problem
by: Alexander Lazarev, et al.
Published: (2024-02-01) -
A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem
by: Dung-Ying Lin, et al.
Published: (2021-04-01) -
Scheduling a Single Machine with Primary and Secondary Objectives
by: Nodari Vakhania
Published: (2018-06-01) -
Machine Learning and Inverse Optimization for Estimation of Weighting Factors in Multi-Objective Production Scheduling Problems
by: Hidetoshi Togo, et al.
Published: (2022-09-01)