Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties-Reference-Cited by-同舟云学术

Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties

Published:2008-11 Issue:11 Volume:35 Page:3696-3713
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Valente Jorge M.S.,Alves Rui A.F.S.

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modeling and Simulation,General Computer Science

Reference25 articles.

1. The production of several items in a single facility with linearly changing demand rates;Wagner;Decision Sciences,2002

2. Korman K. A pressing matter. Video 1994; 46–50.

3. Landis K. Group technology and cellular manufacturing in the Westvaco Los Angeles VH department. Project report in IOM 581, School of Business, University of Southern California, 1993.

4. Valente JMS. An exact approach for single machine scheduling with quadratic earliness and tardiness penalties. Working Paper 238, Faculdade de Economia, Universidade do Porto, Portugal, 2007.

5. Dynamic programming state-space relaxation for single machine scheduling;Abdul-Razaq;Journal of the Operational Research Society,1988

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

1. A biased random-key genetic algorithm for the knapsack problem with forfeit sets;Soft Computing;2024-07-31

2. No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines;Computers & Operations Research;2021-08

3. Online heuristic for the preemptive single machine scheduling problem to minimize the total weighted tardiness;Computers & Industrial Engineering;2021-05

4. Efficient procedures for the weighted squared tardiness permutation flowshop scheduling problem;Flexible Services and Manufacturing Journal;2019-07-02

5. Random-Key Genetic Algorithms;Handbook of Heuristics;2018