Insertion of an operation inside an existing schedule is the central part of some neighbourhood search methods for off-line job-shop scheduling. It is also a basic tool to integrate unexpected jobs during on-line scheduling. In this paper is presented a new polynomial insertion algorithm of an operation inside a multi-resource job-shop schedule with sequence-dependent setup times. The considered objective is maximum lateness minimization. The algorithm is first described for the classical job-shop scheduling problem. Then, multi-resource requirements are introduced for the operations. Last, sequence-dependent setup times are considered in the multi-resource context. It is shown in the three cases that some dominance properties make the proposed insertion algorithm superior to the enumeration algorithms that can be used alternatively.
An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related Research Data
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.