Advanced search
Publication Cover
A I I E Transactions Volume 12, 1980 - Issue 3
Journal homepage
20
Views
15
CrossRef citations to date
0
Altmetric
Original Articles

Scheduling in a Semi-Ordered Flow-shop Without Intermediate Queues

R. K. Arora Computer Centre Indian Institute of Technology, Hauz Khas, New Delhi, 110 029, INDIA
&
S. P. Rana Computer Centre Indian Institute of Technology, Hauz Khas, New Delhi, 110 029, INDIA
Pages 263-272 | Received 01 Jun 1978, Published online: 06 Jul 2007

Citations (15)

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)

Christos Koulamas & George J. Kyparisis. (2021) The no-wait flow shop with rejection. International Journal of Production Research 59:6, pages 1852-1859.
Read now
Sven Axsäter. (1982) On Scheduling in a Semi-Ordered Flow Shop Without Intermediate Queues. A I I E Transactions 14:2, pages 128-130.
Read now

Articles from other publishers (13)

Mostafa Khatami, Amir Salehipour & T.C.E. Cheng. (2023) Flow-shop scheduling with exact delays to minimize makespan. Computers & Industrial Engineering 183, pages 109456.
Crossref
Christos Koulamas & George J. Kyparisis. (2022) Flow shop scheduling with two distinct job due dates. Computers & Industrial Engineering 163, pages 107835.
Crossref
S. S. Panwalkar & Christos Koulamas. (2019) Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines. Journal of Scheduling 23:1, pages 145-154.
Crossref
Christos Koulamas & S.S. Panwalkar. (2018) New index priority rules for no-wait flow shops. Computers & Industrial Engineering 115, pages 647-652.
Crossref
S.S. Panwalkar, Milton L. Smith & Christos Koulamas. (2013) Review of the ordered and proportionate flow shop scheduling research. Naval Research Logistics (NRL) 60:1, pages 46-55.
Crossref
Hamilton Emmons & George VairaktarakisHamilton Emmons & George Vairaktarakis. 2013. Flow Shop Scheduling. Flow Shop Scheduling 189 220 .
S.S. Panwalkar & Christos Koulamas. (2012) An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines. European Journal of Operational Research 221:1, pages 7-13.
Crossref
Vladimir G. Deĭneko, Dvir Shabtay & George Steiner. (2010) On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices. Journal of Heuristics 17:1, pages 61-96.
Crossref
SANTOSH N. KABADI. (2011) GENERALISATIONS OF THE GILMORE-GOMORY TRAVELING SALESMAN PROBLEM AND THE GILMORE-GOMORY SCHEME: A SURVEY. International Game Theory Review 03:02n03, pages 213-235.
Crossref
Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van der Veen & Gerhard J. Woeginger. (1998) Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey. SIAM Review 40:3, pages 496-546.
Crossref
John Mittenthal, M. Raghavachari & Arif I. Rana. (1995) V- and GG-shaped properties for optimal single machine schedules for a class of non-separable penalty functions. European Journal of Operational Research 86:2, pages 262-269.
Crossref
W.J. Selen & D.D. Hott. (1986) A new formulation and solution of the flowshop scheduling problem with no in-process waiting. Applied Mathematical Modelling 10:4, pages 246-248.
Crossref
Hans Röck. (1984) The Three-Machine No-Wait Flow Shop is NP-Complete. Journal of the ACM 31:2, pages 336-345.
Crossref

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.