This shareable PDF can be hosted on any platform or network and is fully compliant with publisher copyright.
This paper gives a polynomial algorithm for the open shop problem with unit processing times, tree precedence constraints and minimization of makespan.
This page is a summary of: A polynomial algorithm for the [n/m/0, tij = 1, tree/Cmax] open shop problem, European Journal of Operational Research, January 1994, Elsevier,
DOI: 10.1016/0377-2217(94)90335-2.
You can read the full text:
The following have contributed to this page
PLoS ONE
This paper investigates the impacts of industrial agglomeration on income inequality and their spatial correlation in China. The result shows that industrial agglomeration and income inequality pre...
PLoS ONE
This study focuses on construction projects. It is generally thought of and understood that different project types usually have and embody different characteristics. Through focussing on the diffe...
Geophysical Research Letters
Using lunar laser ranging and GRAIL gravity data we have estimated the polar flattening and the core radius of the Moon. We discover that a region of intersection is obtained between the observed c...
