Portal de Periódicos da CAPES

Erratum “Optimal Sequencing of Two Equivalent Processors”

1971; Society for Industrial and Applied Mathematics; Volume: 20; Issue: 1 Linguagem: Inglês

10.1137/0120018

1095-712X

M. Fujii, Tadao Kasami, Keiken Ninomiya,

Optimization and Packing Problems

Previous article Full AccessErratum “Optimal Sequencing of Two Equivalent Processors”M. Fujii, T. Kasami, and K. NinomiyaM. Fujii, T. Kasami, and K. Ninomiyahttps://doi.org/10.1137/0120018PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout"Erratum “Optimal Sequencing of Two Equivalent Processors”." SIAM Journal on Applied Mathematics, 20(1), p. 141[1] M. Fujii, , T. Kasami and , K. Ninomiya, Optimal sequencing of two equivalent processors, SIAM J. Appl. Math., 17 (1969), 784–789 10.1137/0117070 MR0253731 0205.48603 LinkISIGoogle Scholar[2] Jack Edmonds, Paths, trees, and flowers, Canad. J. Math., 17 (1965), 449–467 MR0177907 0132.20903 CrossrefISIGoogle Scholar Previous article FiguresRelatedReferencesCited byDetails A Monte Carlo simulation based chaotic differential evolution algorithm for scheduling a stochastic parallel processor systemExpert Systems with Applications, Vol. 42, No. 20 Cross Ref An efficient algorithm for finding ideal schedules20 November 2011 | Acta Informatica, Vol. 49, No. 1 Cross Ref Heuristics for assembly operation scheduling problem in flexible assembly systems25 January 2006 | The International Journal of Advanced Manufacturing Technology, Vol. 29, No. 9-10 Cross Ref Scheduling on Parallel Processors Cross Ref W[2]-hardness of precedence constrained K-processor schedulingOperations Research Letters, Vol. 18, No. 2 Cross Ref Parallel Processor Scheduling Cross Ref Chapter 9 Sequencing and scheduling: Algorithms and complexity Cross Ref A GRAPH-THEORETIC MODEL FOR THE SCHEDULING PROBLEM AND ITS APPLICATION TO SIMULTANEOUS RESOURCE SCHEDULING Cross Ref A state-of-the-art review of parallel-machine scheduling researchEuropean Journal of Operational Research, Vol. 47, No. 3 Cross Ref Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule LengthJianzhong Du and Joseph Y.-T. Leung8 August 2006 | SIAM Journal on Discrete Mathematics, Vol. 2, No. 2AbstractPDF (2406 KB)References Cross Ref Profile Scheduling of Opposing Forests and Level OrdersDanny Dolev and Manfred K. Warmuth17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 6, No. 4AbstractPDF (3058 KB)Applications of scheduling theory to formal language theoryTheoretical Computer Science, Vol. 37 Cross Ref On the Complexity of General Graph Factor ProblemsD. G. Kirkpatrick and P. Hell13 July 2006 | SIAM Journal on Computing, Vol. 12, No. 3AbstractPDF (1095 KB)Scheduling Opposing ForestsM. R. Garey, D. S. Johnson, R. E. Tarjan, and M. Yannakakis17 July 2006 | SIAM Journal on Algebraic Discrete Methods, Vol. 4, No. 1AbstractPDF (2746 KB)Scheduling Interval-Ordered TasksC. H. Papadimitriou and M. Yannakakis13 July 2006 | SIAM Journal on Computing, Vol. 8, No. 3AbstractPDF (513 KB)Two-Processor Scheduling with Start-Times and DeadlinesM. R. Garey and D. S. Johnson31 July 2006 | SIAM Journal on Computing, Vol. 6, No. 3AbstractPDF (1447 KB)Worst Case Analysis of Two Scheduling AlgorithmsShui Lam and Ravi Sethi31 July 2006 | SIAM Journal on Computing, Vol. 6, No. 3AbstractPDF (1946 KB)Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, Vol. 23, No. 3 Cross Ref Bounds for Multiprocessor Scheduling with Resource ConstraintsM. R. Garey and R. L. Graham13 July 2006 | SIAM Journal on Computing, Vol. 4, No. 2AbstractPDF (1085 KB)Bounds on scheduling with limited resourcesACM SIGOPS Operating Systems Review, Vol. 7, No. 4 Cross Ref Optimal scheduling for two-processor systemsActa Informatica, Vol. 1, No. 3 Cross Ref Volume 20, Issue 1| 1971SIAM Journal on Applied Mathematics History Submitted:02 February 1970Published online:12 July 2006 InformationCopyright © 1971 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0120018Article page range:pp. 141-141ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics