Abstract
We consider the minimisation of the mean completion time and the makespan in the single machine scheduling problem with ready times. A tabu-search-based heuristic procedure is proposed to find the sequence which allows one to reach a value of the cost function as close as possible to the global minimum. Computational tests have been carried out to compare the performances of the tabu search procedure with those of a branch and bound algorithm which gives the optimal solution for problems that are not too large. A comparison has also been made with three heuristics, recently presented by Liu-MacCarthy, which have given good outcomes both in terms of mean completion time and response time. Our comparisons have been made both in terms of mean completion time and makespan. The tabu search response time has been considered to asses the reliability of the method. Computational tests show that, with respect to the completion time, the tabu search yields excellent sequences.
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.
