Advanced search
Publication Cover
Journal of the Operational Research Society Volume 30, 1979 - Issue 7
Submit an article Journal homepage
1
Views
20
CrossRef citations to date
0
Altmetric
Theoretical Paper

Flow Shop Scheduling Problems with No In-Process Waiting: A Special Case

S. S. PanwalkarDepartment of Industrial EngineeringTexas Tech University Box 4130 TX 79409LubbockU.S.A.
&
C. R. WoollamDepartment of Industrial EngineeringTexas Tech University Box 4130 TX 79409LubbockU.S.A.
Pages 661-664 | Published online: 20 Dec 2017

Citations (20)

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 (5)

Dipak Laha, Jatinder N D Gupta & Sagar U Sapkal. (2014) A penalty-shift-insertion-based algorithm to minimize total flow time in no-wait flow shops. Journal of the Operational Research Society 65:10, pages 1611-1624.
Read now
P. M. FranÇa, G. Tin$suffix/text()$suffix/text() & L. S. Buriol. (2006) Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions. International Journal of Production Research 44:5, pages 939-957.
Read now
DAVIDW. HE, ANDREW KUSIAK & A. ARTIBA. (1996) A scheduling problem in glass manufacturing. IIE Transactions 28:2, pages 129-139.
Read now
LAWRENCED. BURNS & CARLOSF. DAGANZO. (1987) Assembly line job sequencing principles. International Journal of Production Research 25:1, pages 71-99.
Read now
E. Menipaz. (1983) Scheduling Models: Shibboleth and Operating Characteristics. Journal of Information and Optimization Sciences 4:1, pages 49-64.
Read now

Articles from other publishers (15)

Aslıhan Çakmak, Zeynep Ceylan & Serol Bulkan. 2024. Advances in Intelligent Manufacturing and Service System Informatics. Advances in Intelligent Manufacturing and Service System Informatics 161 173 .
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
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
Mostafa Khatami, Amir Salehipour & F.J. Hwang. (2019) Makespan minimization for the m-machine ordered flow shop scheduling problem. Computers & Operations Research 111, pages 400-414.
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 .
Sagar U. Sapkal, Dipak Laha & Dhiren Kumar Behera. (2012) Optimization Techniques for No-Wait Manufacturing Scheduling: A Review. Advanced Materials Research 488-489, pages 1114-1118.
Crossref
Alain Guinet & Marie Legrand. (1998) Reduction of job-shop problems to flow-shop problems with precedence constraints. European Journal of Operational Research 109:1, pages 96-110.
Crossref
Alain Hertz, Yves Mottet & Yves Rochat. (1996) On a scheduling problem in a robotized analytical system. Discrete Applied Mathematics 65:1-3, pages 285-318.
Crossref
Ding-Yu Chan. 1991. Advances in Production Management Systems. Advances in Production Management Systems 567 574 .
Alessandro Agnetis. 1990. System Modelling and Optimization. System Modelling and Optimization 436 445 .
A. Agnetis, F. Nicolò & M. Lucertini. (1989) Just-in-time Scheduling in a Pipeline Manufacturing System. IFAC Proceedings Volumes 22:14, pages 81-87.
Crossref
F. Carl Knopf. (1985) Sequencing a generalized two-stage flowshop with finite intermediate storage. Computers & Chemical Engineering 9:3, pages 207-221.
Crossref
R. BELLMAN, A.O. ESOGBUE & I. NABESHIMA. 1982. Mathematical Aspects of Scheduling and Applications. Mathematical Aspects of Scheduling and Applications 235 257 .

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.