Abstract
In this research paper, n jobs have to be scheduled on one-machine to minimize the sum of maximum earliness and maximum tardiness. We solved a series of bi-criteria scheduling problems that related to minimize the sum of the maximum earliness and tardiness. Three new algorithms were presented, two for hierarchical objective and one for the simultaneous objective. Using the results of these algorithms, we minimize the sum of maximum earliness and maximum tardiness. This objective considered as one of the NP-hard problem, and it is also irregular, so this objective missed some helpful properties of regularity. The proposed algorithms had simple structures, and simple to implement. Lastly, they tested for different n.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
