A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
Authors:
- Xianpeng WangXWXianpeng Wang
- Lixin TangLTLixin Tang
- 1 September 2010
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 37 (9) , 1624-1640
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (60674084)
- National Natural Science Foundation of China (70902065)
- National Natural Science Foundation of China (70425003)
This publication has 30 references indexed in Scilit:
- Applying hybrid meta-heuristics for capacitated vehicle routing problemExpert Systems with Applications, 2009
- A hybrid electromagnetism-like algorithm for single machine scheduling problemExpert Systems with Applications, 2009
- Particle swarm optimization and differential evolution for the single machine total weighted tardiness problemInternational Journal of Production Research, 2006
- A hybrid search algorithm with heuristics for resource allocation problemInformation Sciences, 2005
- A new hybrid heuristic approach for solving large traveling salesman problem*1Information Sciences, 2004
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- A Tabu Scatter Search Metaheuristic for the Arc Routing ProblemComputers & Industrial Engineering, 2003
- The prize collecting traveling salesman problem: II. Polyhedral resultsNetworks, 1995
- The prize collecting traveling salesman problemNetworks, 1989
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977