Bounds for naive multiple machine scheduling with release times and deadlines-Reference-Cited by-同舟云学术

Bounds for naive multiple machine scheduling with release times and deadlines

Published:1984-03 Issue:1 Volume:5 Page:1-6
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Gusfield Dan

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference12 articles.

1. Computers and Intractability;Garey,1979

2. Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines;Simons;SIAM J. Comput.,1983

3. Analysis of a heuristic for one machine sequencing with release dates and delivery times;Potts;Operations Res.,1980

4. A fast algorithm for single processor scheduling;Simons,1978

5. J. Carlier, “Problem a une machine dans le cas ou les taches ont des durees egales,” Technical report Institut de Programmation, Universitye Paris VI.

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

1. A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints;Operational Research;2024-04-13

2. Approximation Non-list Scheduling Algorithms for Multiprocessor System;Communications in Computer and Information Science;2022

3. Approximation and Exact Algorithms for Multiprocessor Scheduling Problem with Release and Delivery Times;Recent Advances in Computational Optimization;2021-12-15

4. Scheduling ortsfester Gebrauchsfaktoren;Produktionstheorie 4;2021

5. Parallel Scheduling Subject to Release Dates and Delivery Times Under the Non-idling Constraint;Informatics in Control, Automation and Robotics;2019-04-18