Advanced search
Publication Cover
International Journal of Production Research Volume 53, 2015 - Issue 4
Submit an article Journal homepage
406
Views
8
CrossRef citations to date
0
Altmetric
Note

Two-stage flow shop scheduling with dedicated machines

Bertrand M.T. LinDepartment of Information Management and Finance, Institute of Information Management, National Chiao Tung University, Hsinchu, Taiwan.Correspondence[email protected]
Pages 1094-1097 | Received 23 Mar 2014, Accepted 09 Jul 2014, Published online: 05 Aug 2014

References

  • Gerstl, E., and G. Mosheiov. 2012. “A Two-stage Flowshop with a Critical Machine and Batch Availability.” Foundations of Computing and Decision Sciences 37: 39–56.
  • Herrmann, J. W., and C. Y. Lee. 1992. Three-machine Look-ahead Scheduling Problems. Research Report 92–93. Department of Industrial Engineering, University of Florida, Florida.
  • Huang, T. C., and B. M. T. Lin. 2013. “Batch Scheduling in Differentiation Flow Shops for Makespan Minimisation.” International Journal of Production Research 51 (17): 5073–5082.
  • Kyparisis, G. J., and C. Koulamas. 2000. “Flow Shop and Open Shop Scheduling with a Critical Machine and Two Operations Per Job.” European Journal of Operational Research 127 (1): 120–125.
  • Lin, B. M. T. 1999. “On the Strong NP-hardness of Two-stage Flowshop Scheduling Problem with a Common Second-stage Machine.” Computers & Operations Research 26 (7): 695–698.
  • Lin, B. M. T., and F. J. Hwang. 2011. “Total Completion Time Minimization in a 2-stage Differentiation Flowshop with Fixed Sequences Per Job Type.” Information Processing Letters 111 (5): 208–212.
  • Mosheiov, G., and A. Sarig. 2010. “Minimum Weighted Number of Tardy Jobs on an m-machine Flow-shop with a Critical Machine.” European Journal of Operational Research 201 (2): 404–408.
  • Mosheiov, G., and U. Yovel. 2004. “Comments on Flow Shop and Open Shop Scheduling with a Critical Machine and Two Operations Per Job.” European Journal of Operational Research 157 (1): 257–261.
  • Neumytov, Y. D., and S. V. Sevastyanov. 1993. “Approximation Algorithm with Tight Bound for Three-machine Counter-routes Problem (in Russian).” Upravlyaemye Sistemy 31: 53–65.
  • Oǧuz, C., B. M. T. Lin, and T. C. E. Cheng. 1997. “Two-stage Flowshop Scheduling Problem with a Common Second-stage Machine.” Computers & Operations Research 24 (12): 1169–1174.
  • Riane, F., A. Artiba, and S. E. Elmaghraby. 2002. “Sequencing a Hybrid Two-stage Flowshop with Dedicated Machines.” International Journal of Production Research 40: 4353–4380.
  • Yang, J. 2010. “A New Complexity Proof for the Two-stage Hybrid Flow Shop Scheduling Problem with Dedicated Machines.” International Journal of Production Research 48 (5): 1531–1538.

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.