 |
 |
 หัวเรื่อง:ไม่มีชื่อไทย (ชื่ออังกฤษ : COMPLEXITY OF TWO-MACHINE SCHEDULING WITH BUNDLING OPERATIONS AND TOTAL FLOW-TIME MINIMIZATION) ผู้เขียน: George Vairaktarakis สื่อสิ่งพิมพ์:pdf AbstractWe consider a two-machine scheduling problem in which each job consists of a single operation per machine, and the operations of a job can be performed in parallel. The completion time of a job is the maximum of the completion times of its operations. The objective is to minimize the total flow time of the jobs. In this article, we provide an alternative NP-hardness proof for the problem. |
|
 |