Fast neighborhood search for the single machine total weighted tardiness problem-Reference-Cited by-同舟云学术

Fast neighborhood search for the single machine total weighted tardiness problem

Published:2006-01 Issue:1 Volume:34 Page:41-45
ISSN:0167-6377
Container-title:Operations Research Letters
language:en
Short-container-title:Operations Research Letters

Author:

Ergun Özlem,Orlin James B.

Publisher

Elsevier BV

Subject

Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software

Reference7 articles.

1. An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem;Congram;INFORMS J. Comput.,2002

2. Ö. Ergun, New neighborhood search algorithms based on exponentially large neighborhoods, Operations Research Center Thesis, MIT, Cambridge, MA, 2001.

3. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem;Grosso;Oper. Res. Lett.,2004

4. A ‘pseudopolynomial’ algorithm for sequencing jobs to minimize total tardiness;Lawler,1977

5. Complexity of machine scheduling problems;Lenstra,1977

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

1. A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems;Journal of Scheduling;2017-12-15

2. The Vehicle Routing Problem with Release and Due Dates;INFORMS Journal on Computing;2017-11

3. A hybrid evolutionary approach for the single-machine total weighted tardiness problem;Computers & Industrial Engineering;2017-06

4. Breakout dynasearch for the single-machine total weighted tardiness problem;Computers & Industrial Engineering;2016-08

5. A destroy and repair algorithm for the Bike sharing Rebalancing Problem;Computers & Operations Research;2016-07