Algorithms for single machine total tardiness scheduling with sequence dependent setups-Reference-Cited by-同舟云学术

Algorithms for single machine total tardiness scheduling with sequence dependent setups

Published:2006-12 Issue:2 Volume:175 Page:722-739
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Gupta Skylab R.,Smith Jeffrey S.

Publisher

Elsevier BV

Subject

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

Reference22 articles.

1. Theory of Scheduling;Conway,1967

2. A review of scheduling research involving setup considerations;Allahverdi;Omega,1999

3. Sequencing research and the industrial scheduling problem;Panwalkar,1973

4. Impact of sequence dependent setup time on job shop scheduling performance;Kim;International Journal of Production Research,1994

5. Minimizing total tardiness on one machine is np-hard;Du;Mathematics of Operations Research,1990

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

1. Exploring the evolution of machine scheduling through a computational approach;Engineering Applications of Artificial Intelligence;2024-07

2. Neighborhood Combination Search for Single-Machine Scheduling with Sequence-Dependent Setup Time;Journal of Computer Science and Technology;2024-05

3. Achieving sustainability through improvement in the textile wet process using particle swarm optimization and the tabu search algorithm;Textile Research Journal;2022-10-03

4. Variable neighbourhood search for job scheduling with position-dependent deteriorating processing times;Journal of the Operational Research Society;2022-04-26

5. Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints;Annals of Mathematics and Artificial Intelligence;2019-06-27