Indexed by:期刊论文

Date of Publication:2017-03-29

Journal:THEORETICAL COMPUTER SCIENCE

Included Journals:SCIE

Volume:670

Page Number:79-85

ISSN No.:0304-3975

Key Words:Flow shop problems; NP-hard; Complexity

Abstract:In this paper we study a flow shop problem F2 -> D vertical bar v =1, c >= I vertical bar C-max with two machines and one transporter: machines A, B and a transporter V which is initially located at machine B. There are a set of jobs needed to be processed on machine A first, then on machine B, and transported to the destination by V finally. Transporter V can carry at most c jobs in one batch where c >= 1. The objective is to minimize the completion time when all the jobs are transported to the destination. Problem F2 -> D vertical bar v = 1, c = 2 vertical bar C-max has been proved to be binary NP-hard in EJ0R2007 [20] when c = 2, we solve the open question in [20] and prove it is strongly NP-hard, i.e., there is no FPTAS for the problem. (C) 2017 Elsevier B.V. All rights reserved.