Advanced search
Publication Cover
International Journal of Production Research Volume 44, 2006 - Issue 4
Submit an article Journal homepage
154
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

Minimizing the total weighted completion time in a two-machine proportionate flow shop with different machine speeds

Byung-Cheon Choi Department of Industrial Engineering, Seoul National University, Seoul, South Korea
,
Suk-Hun Yoon Department of Industrial and Information Systems Engineering, Soongsil University, 1-1 Sangdo-5 Dong, Dongjak-Gu, Seoul 156-743, South KoreaCorrespondence[email protected]
&
Sung-Jin Chung Department of Industrial Engineering, Seoul National University, Seoul, South Korea
Pages 715-728 | Received 01 Jun 2005, Published online: 22 Feb 2007

References

  • Baker , KR . 1995 . Elements of Sequencing and Scheduling , Hanover, NH : Kenneth R. Baker .
  • Croce , FD . 1995 . Generalized pairwise interchanges and machine scheduling . Eur. J. Oper. Res. , 83 : 310 – 319 .
  • Garey , MR and Johnson , DS . 1979 . Computers and Intractability—A Guide to the Thoery of NP-completeness , San Francisco, CA : Freeman .
  • Hall , NG and Postner , ME . 2001 . Generating experimental data for computational testing with machine scheduling applications . Op. Res. , 49 : 854 – 865 .
  • Hoogeveen , JA and Kawaguchi , T . 1999 . Minimizing total completion time in a two-machine flowsop: analysis of special cases . Math. Oper. Res. , 24 : 887 – 910 .
  • Hou , S and Hoogeveen , H . 2003 . The three-machine proportionate flow shop problem with unequal machine speeds . Oper. Res. Lett. , 31 : 225 – 231 .
  • Morton , TE and Pentico , DW . 1993 . Heuristic Scheduling Systems with Applications to Production Systems and Project Management , New York : Wiley .
  • Ow , PS . 1985 . Focused scheduling in proportionate flow shops . Manag. Sci. , 31 : 851 – 869 .
  • Panwalkar , SS and Kahn , AW . 1976 . An ordered flow shop sequencing problem with mean completion time criterion . Int. J. Prod. Res. , 14 : 631 – 635 .
  • Pinedo , M . 1995 . Scheduling: Theory, Algorithms and Systems , Englewood Cliffs, NJ : Prentice Hall .
  • Schuurman , P and Woeginger , GJ . 1999 . Polynomial time approximation algorithms for machine scheduling: ten open problems . J. Schedul. , 2 : 203 – 213 .
  • Sedgewick , R . 1990 . Algorithms in C , Reading, MA : Addison-Wesley .
  • Shakhlevich , N , Hoogeveen , H and Pinedo , M . 1998 . Minimizing total weighted completion time in a proportionate flow shop . J. Schedul. , 1 : 157 – 168 .
  • Smith , ML , Panwalkar , SS and Dudek , RA . 1975 . Flowshop sequencing problem with ordered processing time matrices . Manag. Sci. , 21 : 544 – 549 .
  • Smith , ML , Panwalkar , SS and Dudek , RA . 1976 . Flowshop sequencing problem with ordered processing time matrices: a general case . Nav. Res. Log. Q. , 23 : 481 – 486 .
  • Smutnicki , C . 1998 . Some results of the worst-case analysis for flow shop scheduling . Eur. J. Oper. Res. , 109 : 66 – 87 .
  • Tanaev , VS , Sotskov , YN and Strusevich , VA . 1994 . “ Scheduling Theory ” . In Multi-Stage Systems , Boston, MA : Kluwer .

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.