Minimizing the Total Completion Times, the Total Tardiness and the Maximum Tardiness
In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maxi...
Main Authors: | Tariq S. Abdul-Razaq, Zainab M. Ali |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Baghdad
2017-03-01
|
Series: | Ibn Al-Haitham Journal for Pure and Applied Sciences |
Subjects: | |
Online Access: | https://jih.uobaghdad.edu.iq/index.php/j/article/view/221 |
Similar Items
-
Solving the Multi-criteria, Total Completion Time, Total Earliness Time, and Maximum Tardiness Problem
by: Bayda Atiya kalaf, et al.
Published: (2024-01-01) -
Trajectory Scheduling Methods for minimizing total tardiness in a flowshop
by: Xiaoping Li, et al.
Published: (2015-12-01) -
Effective heuristics for solving dynamic variant of single processor total tardiness problems
by: Saheed Akande, et al.
Published: (2018-01-01) -
A Branch-and-Bound Algorithm for Minimizing the Total Tardiness of Multiple Developers
by: Chung-Ho Su, et al.
Published: (2022-04-01) -
A branch-and-bound algorithm to minimize total tardiness in a two-machine flowshop problem with different release time
by: June-Young BANG, et al.
Published: (2019-11-01)