Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (Q1887781): Difference between revisions

Latest revision as of 11:56, 16 December 2024

scientific article

Language	Label	Description	Also known as
English	Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity	scientific article

Statements

instance of

scholarly article

0 references

title

Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity (English)

0 references

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

22 November 2004

0 references

zbMATH Keywords

Flow-shop

0 references

No buffer

0 references

Limited buffers

0 references

Markovian analysis

0 references

Scheduling

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2003.08.032

0 references

cites work

Q3983465

0 references

Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop

0 references

Minimizing total expected costs in the two-machine, stochastic flow shop

0 references

A review of the static, stochastic job sequencing literature

0 references

Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity

0 references

A contribution to the stochastic flow shop scheduling problem.

0 references

Les problèmes d'ordonnancement

0 references

Optimal two- and three-stage production schedules with setup times included

0 references

Markov and Markov-Regenerative <scp>pert</scp> Networks

0 references

Stochastically minimizing the makespan in two-machine flow shops without blocking

0 references

On three-machine flow shops with random job processing times

0 references

On Johnson's Two-Machine Flow Shop with Random Processing Times

0 references

Equation of State Calculations by Fast Computing Machines

0 references

Metaheuristics: A bibliography

0 references

Minimizing the Expected Makespan in Stochastic Flow Shops

0 references

Q3525910

0 references

Q4301147

0 references

Q3785827

0 references

The interchangeability of ·/M/1 queues in series

0 references

Identifiers

zbMATH Open document ID

1067.90042

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.EJOR.2003.08.032

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1887781

@@ Property / DOI @@
-.1016/j.ejor.2003.08.032
@@ Property / DOI: 10.1016/j.ejor.2003.08.032 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3983465
@@ Property / cites work: Q3983465 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling jobs, with exponentially distributed processing times, on two machines of a flow shop
+Normal rank
@@ Property / cites work @@
+Minimizing total expected costs in the two-machine, stochastic flow shop
+Normal rank
@@ Property / cites work @@
+A review of the static, stochastic job sequencing literature
+Normal rank
@@ Property / cites work @@
+Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
+Normal rank
@@ Property / cites work @@
+A contribution to the stochastic flow shop scheduling problem.
+Normal rank
@@ Property / cites work @@
+Les problèmes d'ordonnancement
@@ Property / cites work: Les problèmes d'ordonnancement / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+Markov and Markov-Regenerative <scp>pert</scp> Networks
+Normal rank
@@ Property / cites work @@
+Stochastically minimizing the makespan in two-machine flow shops without blocking
+Normal rank
@@ Property / cites work @@
+On three-machine flow shops with random job processing times
+Normal rank
@@ Property / cites work @@
+On Johnson's Two-Machine Flow Shop with Random Processing Times
+Normal rank
@@ Property / cites work @@
+Equation of State Calculations by Fast Computing Machines
+Normal rank
@@ Property / cites work @@
+Metaheuristics: A bibliography
@@ Property / cites work: Metaheuristics: A bibliography / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing the Expected Makespan in Stochastic Flow Shops
+Normal rank
@@ Property / cites work @@
+Q3525910
@@ Property / cites work: Q3525910 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4301147
@@ Property / cites work: Q4301147 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3785827
@@ Property / cites work: Q3785827 / rank @@
+Normal rank
@@ Property / cites work @@
+The interchangeability of ·/M/1 queues in series
@@ Property / cites work: The interchangeability of ·/M/1 queues in series / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2003.08.032
@@ Property / DOI: 10.1016/J.EJOR.2003.08.032 / rank @@
+Normal rank