Longest path analysis in networks of queues: Dynamic scheduling problems

@article{Azaron2006LongestPA,
  title={Longest path analysis in networks of queues: Dynamic scheduling problems},
  author={Amir Azaron and Hideki Katagiri and Kosuke Kato and Masatoshi Sakawa},
  journal={European Journal of Operational Research},
  year={2006},
  volume={174},
  pages={132-149}
}
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input station according to a Poisson process, assuming each order consists of n jobs. Jobs associated with successive orders contend for resources on a FCFS (First Come First Served) dispatching rule in all machines. Upon arriving each order, it is splitted into n jobs, in which each job joins the related queue for the first… CONTINUE READING
8 Citations
24 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Fundamentals of Queueing Theory

  • D. Gross, M. Harris
  • second ed., John Wiley & Sons, New York
  • 1985
Highly Influential
4 Excerpts

A classified bibliography of research on stochastic PERT networks: 1966–1987

  • V. Adlakha, V. Kulkarni
  • INFOR 27
  • 1989
Highly Influential
4 Excerpts

Distribution of the time through a directed acyclic network

  • J. Martin
  • Operations Research 13 (1965) 46–66. A. Azaron…
  • 2006
1 Excerpt

Distribution function of the shortest path in networks of queues

  • A. Azaron, M. Modarres
  • OR Spectrum 27
  • 2005
2 Excerpts

The impact of priority rule combinations on lateness and tardiness

  • S. Barman
  • IIE Transactions 30
  • 1998
2 Excerpts

Design of efficient job shop scheduling rules

  • O. Holthaus
  • Computers and Industrial Engineering 33
  • 1997
2 Excerpts

Similar Papers

Loading similar papers…