Linear scheduling method

Known as: LSM, Linear scheduling, Location-based scheduling 
Linear Scheduling Method (LSM) is a graphical scheduling method focusing on continuous resource utilization in repetitive activities. It is believed… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
  • Cindy A. Usyor, Henry Wardhana
  • 2018
 
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Cloud computing technology virtualizes and offers many services across the network. It mainly aims at scalability, availability… (More)
Is this relevant?
2011
2011
Glacier surges are a well-known example of an internal dynamic oscillation whose occurrence is not a direct response to the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
Pipeline construction is a highly repetitive and resource-intensive process that is exposed to various constraints and… (More)
  • figure 2
  • figure 1
  • table 1
  • table 2
  • figure 3
Is this relevant?
2007
2007
Volume–area scaling provides a practical alternative to ice-flow modelling to account for glacier size changes when modelling the… (More)
Is this relevant?
2004
2004
This paper describes a genetic algorithm (GA) to solve the problem of optimal facilities layout in manufacturing systems design… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2000
2000
This paper considers the problem of scheduling part families and jobs within each part family in a ̄owline manufacturing cell… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2000
2000
For finite-buffer manufacturing systems, the major stability issue is ‘deadlock’, rather than ‘bounded-buffer-length stability… (More)
Is this relevant?
1998
1998
A major portion of highway construction work is comprised of linear activities. A linear activity is one tha progresses along a… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper deals with the problem of nding optimal schedulings for uniform dependence algorithms. Given a convex domain, let T f… (More)
Is this relevant?