A better algorithm for sequencing with release and delivery times on identical machines-Reference-Cited by-同舟云学术

A better algorithm for sequencing with release and delivery times on identical machines

Published:2003-09 Issue:2 Volume:48 Page:273-293
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Vakhania Nodari

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference12 articles.

1. On sequencing with earliest start times and due-dates with application to computing bounds for (n/m/G/Fmax) problem;Bratley;Naval Res. Logist. Quart.,1973

2. J. Carlier, Problèmes d'ordonnancement à durées égales, Technical report, 1981, Institut de Programmàtion, Université Paris, IV-75012 Paris, France

3. The one-machine sequencing problem;Carlier;European J. Oper. Res.,1982

4. Scheduling unit-time tasks with arbitrary release times and deadlines;Garey;SIAM J. Comput.,1981

5. A block approach for single machine scheduling with release dates and due dates;Grabowski;European J. Oper. Res.,1986

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

1. Bicriteria multi-machine scheduling with equal processing times subject to release dates;Networks and Heterogeneous Media;2023

2. Polynomially Solvable and NP-hard Special Cases for Scheduling with Heads and Tails;International Journal of Electrical Engineering and Computer Science;2022-06-04

3. Theoretical and practical issues in single-machine scheduling with two job release and delivery times;Journal of Scheduling;2021-09-09

4. Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines;Mathematics;2021-03-16

5. Fast Approximation for Scheduling One Machine;Mathematics;2020-09-07