Advanced search
Publication Cover
International Journal of Production Research Volume 14, 1976 - Issue 5
Submit an article Journal homepage
48
Views
30
CrossRef citations to date
0
Altmetric
Original Articles

An ordered flow-shop sequencing problem with mean completion time criterion†

S. S. PANWALKAR Department of Industrial Engineering, Texas Tech University, Lubbock, TX, 79409, U.S.A
&
A. W. KHAN American Science and Engineering Company, Houston, TX, 77002, U.S.A.
Pages 631-635 | Received 10 Apr 1975, Published online: 07 May 2007

Citations (30)

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

Byung-Cheon Choi, Suk-Hun Yoon & Sung-Jin Chung. (2006) Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds. International Journal of Production Research 44:4, pages 715-728.
Read now
P. C. Bagga & Ambika. Bhambani. (1997) Minimizing Mean Completion Time for Special Flowshop Problems. Optimization 40:1, pages 85-100.
Read now
MEI QI. (1996) Scheduling two-stage production lines with multiple machines. Production Planning & Control 7:4, pages 418-429.
Read now
SAMEERC. JHAVERI & BOBBIEL. FOOTE. (1991) A heuristic algorithm to schedule work in the repair industry. International Journal of Production Research 29:12, pages 2393-2405.
Read now
DING-YU CHAN & DAVIDD. BEDWORTH. (1990) Design of a scheduling system for flexible manufacturing cells†. International Journal of Production Research 28:11, pages 2037-2049.
Read now
Wlodzimierz Szwarc. (1983) The Flow-Shop Problem with Mean Completion Time Criterion. IIE Transactions 15:2, pages 172-176.
Read now

Articles from other publishers (24)

Xiaojuan Jiang, Kangbok Lee & Michael L. Pinedo. (2023) Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits. Journal of Scheduling.
Crossref
S.S. Panwalkar & Christos Koulamas. (2017) On the dominance of permutation schedules for some ordered and proportionate flow shop problems. Computers & Industrial Engineering 107, pages 105-108.
Crossref
BYUNG-CHEON CHOI & MYOUNG-JU PARK. (2014) OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES. Asia-Pacific Journal of Operational Research 31:04, pages 1450028.
Crossref
Dae-Young Chung & Byung-Cheon Choi. (2013) Outsourcing and scheduling for two-machine ordered flow shop scheduling problems. European Journal of Operational Research 226:1, pages 46-52.
Crossref
S.S. Panwalkar & Christos Koulamas. (2013) The three-stage ordered flow shop problem with flexible stage ordering. Computers & Industrial Engineering 64:4, pages 1093-1095.
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 97 160 .
Hamilton Emmons & George VairaktarakisHamilton Emmons & George Vairaktarakis. 2013. Flow Shop Scheduling. Flow Shop Scheduling 21 66 .
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
Byung-Cheon Choi, Joseph Y.-T. Leung & Michael L. Pinedo. (2010) Minimizing makespan in an ordered flow shop with machine-dependent processing times. Journal of Combinatorial Optimization 22:4, pages 797-818.
Crossref
Byung-Cheon Choi & Jibok Chung. (2011) Two-machine flow shop scheduling problem with an outsourcing option. European Journal of Operational Research 213:1, pages 66-72.
Crossref
Byung-Cheon Choi, Joseph Y.-T. Leung & Michael L. Pinedo. (2010) A note on makespan minimization in proportionate flow shops. Information Processing Letters 111:2, pages 77-81.
Crossref
Byung-Cheon Choi, Kangbok Lee, Joseph Y.-T. Leung & Michael L. Pinedo. (2010) Flow shops with machine maintenance: Ordered and proportionate cases. European Journal of Operational Research 207:1, pages 97-104.
Crossref
Chia-Shin Chung, James Flynn & Omer Kirca. (2002) A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems. International Journal of Production Economics 79:3, pages 185-196.
Crossref
Jatinder N.D Gupta, Venkata R Neppalli & Frank Werner. (2001) Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International Journal of Production Economics 69:3, pages 323-338.
Crossref
Ali Allahverdi. (1999) Stochastically minimizing total flowtime in flowshops with no waiting space. European Journal of Operational Research 113:1, pages 101-112.
Crossref
Christos Koulamas. (1998) On the complexity of two-machine flowshop problems with due date related objectives. European Journal of Operational Research 106:1, pages 95-100.
Crossref
Johnny C. Ho & Jatinder N.D. Gupta. (1995) Flowshop scheduling with dominant machines. Computers & Operations Research 22:2, pages 237-246.
Crossref
A. Allahverdi & J. Mittenthal. (1994) Two-machine ordered flowshop scheduling under random breakdowns. Mathematical and Computer Modelling 20:2, pages 9-17.
Crossref
Selcuk Karabati & Panagiotis Kouvelis. (1993) The permutation flow shop problem with sum-of-completion times performance criterion. Naval Research Logistics 40:6, pages 843-862.
Crossref
R.C. Mishra, P.C. Pandey & J.L. Gaindhar. (1988) Multi-product flowshop scheduling with ordered processing times. Computers & Industrial Engineering 14:3, pages 361-364.
Crossref
I Adiri & N Amit. (1984) Openshop and flowshop scheduling to minimize sum of completion times. Computers & Operations Research 11:3, pages 275-284.
Crossref
R. BELLMAN, A.O. ESOGBUE & I. NABESHIMA. 1982. Mathematical Aspects of Scheduling and Applications. Mathematical Aspects of Scheduling and Applications 162 199 .
Jatinder N. D. Gupta. 1979. Disaggregation. Disaggregation 363 388 .

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.