Abstract
Solving realistic scheduling problems in a reasonable amount of computer time almost inevitably requires the use of heuristic methods. Such a problem is the one-machine sequencing problem where the jobs are subject to unequal release times. Here a recently published heuristic is generalised and these generalisations are shown to provide very good solutions to some large problems in a modest amount of computer time. The heuristic is further extended by applying the method of tabu search, which is used for investigating the quality of the solutions obtained by the original heuristics.
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.
