A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem-Reference-Cited by-同舟云学术

A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem

Published:2005-04 Issue:1 Volume:162 Page:281-289
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Angel E.,Bampis E.

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference21 articles.

1. A survey of very large-scale neighborhood search techniques;Ahuja;Discrete Applied Mathematics,2002

2. Scheduling with time dependent processing times: Review and extensions;Alidaee;Journal of the Operational Research Society,1999

3. Machine scheduling;Anderson,1997

4. On the quality of local search for the quadratic assignment problem;Angel;Discrete Applied Mathematics,1998

5. On the classification of NP-complete problems in terms of their correlation coefficient;Angel;Discrete Applied Mathematics,2000

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lagrangean relaxation approach to joint optimization for production planning and scheduling of synchronous assembly lines;International Journal of Production Research;2016-03-14

2. Hybrid Metaheuristics;Artificial Intelligence: Foundations, Theory, and Algorithms;2016

3. Split–merge: Using exponential neighborhood search for scheduling a batching machine;Computers & Operations Research;2015-11

4. A special purpose multi-criteria heuristic function for a single machine scheduling problem with forward dynamic programming;The International Journal of Advanced Manufacturing Technology;2013-04-25

5. Hybrid metaheuristics in combinatorial optimization: A survey;Applied Soft Computing;2011-09