Abstract
This paper deals with a bi-criteria single machine scheduling problem with a time-dependent learning effect and release times. The objective is to minimize the weighted sum of the makespan and the total completion time. The problem is NP-hard, thus a mixed integer non-linear programming formulation is presented, and a set of dominance properties are developed. To solve the problem efficiently, a procedure is then proposed by incorporating the dominance properties with an ant colony optimization algorithm. In the proposed algorithm, artificial ants construct solutions as orders of jobs based on the heuristic information as well as pheromone trails. Then, the dominance properties are added to obtain better solutions. To evaluate the algorithm performance, computational experiments are conducted.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
