Abstract
In this paper, we address the non-delay job-shop scheduling problem. The objective is to minimize the makespan. The non-delay schedules are active schedules in which we will not keep machine idle when there is at least one job waiting to be executed on that machine. In this contribution, we present a new matrix heuristic to generate non-delay schedules by getting matrices of starting and finishing times. The developed heuristic is computationally fast, simple and easy to implement. Finally, a comparative study between two variants of the developed heuristic highlight that the use of an appropriate Priority Dispatching Rule (PDR) for each machine gives best results comparing with the heuristic which applies the same PDR for all machines.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have