Author
Listed:
- Vinícius Vilar Jacob
- José Elias C. Arroyo
Abstract
This paper addresses a single‐machine scheduling problem with sequence‐dependent family setup times. In this problem the jobs are classified into families according to their similarity characteristics. Setup times are required on each occasion when the machine switches from processing jobs in one family to jobs in another family. The performance measure to be minimized is the total tardiness with respect to the given due dates of the jobs. The problem is classified as NP‐hard in the ordinary sense. Since the computational complexity associated with the mathematical formulation of the problem makes it difficult for optimization solvers to deal with large‐sized instances in reasonable solution time, efficient heuristic algorithms are needed to obtain near‐optimal solutions. In this work we propose three heuristics based on the Iterated Local Search (ILS) metaheuristic. The first heuristic is a basic ILS, the second uses a dynamic perturbation size, and the third uses a Path Relinking (PR) technique as an intensification strategy. We carry out comprehensive computational and statistical experiments in order to analyze the performance of the proposed heuristics. The computational experiments show that the ILS heuristics outperform a genetic algorithm proposed in the literature. The ILS heuristic with dynamic perturbation size and PR intensification has a superior performance compared to other heuristics.
Suggested Citation
Vinícius Vilar Jacob & José Elias C. Arroyo, 2016.
"ILS Heuristics for the Single‐Machine Scheduling Problem with Sequence‐Dependent Family Setup Times to Minimize Total Tardiness,"
Journal of Applied Mathematics, John Wiley & Sons, vol. 2016(1).
Handle:
RePEc:wly:jnljam:v:2016:y:2016:i:1:n:9598041
DOI: 10.1155/2016/9598041
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:jnljam:v:2016:y:2016:i:1:n:9598041. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1155/4058 .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.