article

Parallel Sequencing and Assembly Line Problems

Author:

T. C. HuAuthors Info & Claims

Operations Research, Volume 9, Issue 6

Pages 841 - 848

https://doi.org/10.1287/opre.9.6.841

Published: 01 December 1961 Publication History

Abstract

This paper deals with a new sequencing problem in which n jobs with ordering restrictions have to be done by men of equal ability. Assume every man can do any of the n jobs. The two questions considered in this paper are 1 How to arrange a schedule that requires the minimum number of men so that all jobs are completed within a prescribed time T, and 2 if m men are available, arrange a schedule that completes all jobs at the earliest time.

References

[1]

L R FORD, JB AND D R FULKERSON, Flows in Networks, Chap 2, Sec 9 forthcoming, Princeton Univ Press, 1961.

Google Scholar

[2]

S M JOHNSON, "Optimal Two- and Three-Stage Production Schedules with Setup Times Included," Naval Res Log Quart 1, 61-68 (1954).

Crossref

Google Scholar

Cited By

View all

Liu YChen RLi SYang JLi Sda Silva B(2024)FPGA-Based Sparse Matrix Multiplication Accelerators: From State-of-the-Art to Future OpportunitiesACM Transactions on Reconfigurable Technology and Systems10.1145/368748017:4(1-37)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3687480
Agrawal KMoseley BNewman HPruhs KAgrawal KPetrank E(2024)Scheduling Out-Trees Online to Optimize Maximum FlowProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659955(77-88)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659955
Bendotti PBrunod Indrigo LChrétienne PEscoffier B(2024)Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problemsJournal of Scheduling10.1007/s10951-024-00822-z27:6(587-606)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s10951-024-00822-z
Show More Cited By

Parallel Sequencing and Assembly Line Problems
1. Computing methodologies
  1. Artificial intelligence
    1. Search methodologies
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Sequencing with Series-Parallel Precedence Constraints

One of the most important ideas in the theory of sequencing and scheduling is the method of adjacent pairwise job interchange. This method compares the costs of two sequences which differ only by interchanging a pair of adjacent jobs. In 1956, W. E. ...
Sequencing unreliable jobs on parallel machines

This paper addresses an allocation and sequencing problem motivated by an application in unsupervised automated manufacturing. There are n independent jobs to be processed by one of m machines or units during a finite unsupervised duration or shift. ...
Assembly-Line Scheduling with Concurrent Operations and Parallel Machines

<P>This paper addresses the assembly-line scheduling problem with concurrent operations per stage and parallel machines. This problem can be briefly described as the problem of sequencing a predetermined set of parts with known processing-time ...

Comments

Information & Contributors

Information

Published In

Operations Research Volume 9, Issue 6

December 1961

170 pages

ISSN:0030-364X

Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 December 1961

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

194
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu YChen RLi SYang JLi Sda Silva B(2024)FPGA-Based Sparse Matrix Multiplication Accelerators: From State-of-the-Art to Future OpportunitiesACM Transactions on Reconfigurable Technology and Systems10.1145/368748017:4(1-37)Online publication date: 28-Aug-2024
https://dl.acm.org/doi/10.1145/3687480
Agrawal KMoseley BNewman HPruhs KAgrawal KPetrank E(2024)Scheduling Out-Trees Online to Optimize Maximum FlowProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659955(77-88)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659955
Bendotti PBrunod Indrigo LChrétienne PEscoffier B(2024)Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problemsJournal of Scheduling10.1007/s10951-024-00822-z27:6(587-606)Online publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1007/s10951-024-00822-z
Roy SDevaraj RSarkar A(2023)SAFLA: Scheduling Multiple Real-Time Periodic Task Graphs on Heterogeneous SystemsIEEE Transactions on Computers10.1109/TC.2022.319197072:4(1067-1080)Online publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1109/TC.2022.3191970
Benoit APerotin LRobert YSun H(2022)Checkpointing Workflows à la Young/Daly Is Not Good EnoughACM Transactions on Parallel Computing10.1145/35486079:4(1-25)Online publication date: 16-Dec-2022
https://dl.acm.org/doi/10.1145/3548607
Sudvarg MGill C(2022)Analysis of Federated Scheduling for Integer-Valued WorkloadsProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534892(12-23)Online publication date: 7-Jun-2022
https://dl.acm.org/doi/10.1145/3534879.3534892
Phalakarn KSuppakitpaisarn VHasan M(2022)Speeding-Up Parallel Computation of Large Smooth-Degree Isogeny Using Precedence-Constrained SchedulingInformation Security and Privacy10.1007/978-3-031-22301-3_16(309-331)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22301-3_16
Regragui MCoye BPilla LNamyst RBarthou D(2022)Exploring Scheduling Algorithms for Parallel Task Graphs: A Modern Game Engine Case StudyEuro-Par 2022: Parallel Processing10.1007/978-3-031-12597-3_7(103-118)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-12597-3_7
Roy SDevaraj RSarkar ASenapati D(2021)SLAQAACM Transactions on Embedded Computing Systems10.1145/346277620:5(1-31)Online publication date: 9-Jul-2021
https://dl.acm.org/doi/10.1145/3462776
Wang TBellenguez O(2021)Three notes on scheduling unit-length jobs with precedence constraints to minimize the total completion timeJournal of Scheduling10.1007/s10951-021-00702-w24:6(649-662)Online publication date: 1-Dec-2021
https://dl.acm.org/doi/10.1007/s10951-021-00702-w
Show More Cited By

Abstract

References

Cited By

Recommendations

Sequencing with Series-Parallel Precedence Constraints

Sequencing unreliable jobs on parallel machines

Assembly-Line Scheduling with Concurrent Operations and Parallel Machines

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations