Answers are grounded in this paper and cite their sources.
We study tandem ordering of constant-service stations with unlimited buffers where service at each station adds a certain value to the job. With the goal of minimizing the total expect value of the jobs in the system, we provide conditions under which some particular orderings are optimal and describe a heuristic that finds a near-optimal order for stations of arbitrary service lengths and added values.
No takes yet. Share an insight, caveat, or question.
Winch et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: