A GRASP based on DE to solve single machine scheduling problem with SDST
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Tan, K. C. & Narasimhan, R., 1997. "Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach," Omega, Elsevier, vol. 25(6), pages 619-634, December.
- Franca, Paulo M. & Mendes, Alexandre & Moscato, Pablo, 2001. "A memetic algorithm for the total tardiness single machine scheduling problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 224-242, July.
- Gupta, Skylab R. & Smith, Jeffrey S., 2006. "Algorithms for single machine total tardiness scheduling with sequence dependent setups," European Journal of Operational Research, Elsevier, vol. 175(2), pages 722-739, December.
- Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
- Luo, Xiaochuan & Chu, Chengbin, 2007. "A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness," European Journal of Operational Research, Elsevier, vol. 180(1), pages 68-81, July.
- Choobineh, F. Fred & Mohebbi, Esmail & Khoo, Hansen, 2006. "A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 175(1), pages 318-337, November.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Allahverdi, Ali, 2015. "The third comprehensive survey on scheduling problems with setup times/costs," European Journal of Operational Research, Elsevier, vol. 246(2), pages 345-378.
More about this item
KeywordsScheduling single machine; Greedy randomized adaptive search procedure; Differential evolution; Sequence-dependent setup times; Total tardiness;
StatisticsAccess and download statistics
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:spr:coopap:v:51:y:2012:i:1:p:411-435. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .
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.
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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.