Advanced search
Publication Cover
Journal of the Operational Research Society Volume 22, 1971 - Issue 2
Submit an article Journal homepage
2
Views
8
CrossRef citations to date
0
Altmetric
General Paper

A Precedence Graph Algorithm for the Shop Scheduling Problem

Said AshourKansas State University
&
R. G. ParkerKansas State University
Pages 165-175 | Published online: 19 Dec 2017

Citations (8)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (2)

J. HUTCHISON & Y.-L. CHANG. (1990) Optimal nondelay job shop schedules. International Journal of Production Research 28:2, pages 245-257.
Read now
Said Ashour, T.E. Moore & Kung-Ying Chiu. (1974) An Implicit Enumeration Algorithm for the Nonpreemptive Shop Scheduling Problem. A I I E Transactions 6:1, pages 62-72.
Read now

Articles from other publishers (6)

John R. King & Alexander S. Spachis. (1980) Scheduling: Bibliography & Review. International Journal of Physical Distribution & Materials Management 10:3, pages 103-132.
Crossref
Jatinder N. D. Gupta. 1979. Disaggregation. Disaggregation 363 388 .
. 1975. Integer Programming. Integer Programming 353 373 .
Said Ashour & R. G. Parker. 1973. Symposium on the Theory of Scheduling and Its Applications. Symposium on the Theory of Scheduling and Its Applications 206 223 .
S. Ashour, K. Y. Chiu & T. E. Moore. (2006) An optimal schedule time of a job shop‐like disjunctive graph. Networks 3:4, pages 333-349.
Crossref
Said AshourSaid Ashour. 1972. Sequencing Theory. Sequencing Theory 5 33 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.