<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css">

Browsing by Author "Tsai, Yen-Shing"

Now showing 1 - 1 of 1
  • Thumbnail Image
    Item type:Item,
    Flow shop non-idle scheduling and resource-constrained scheduling
    (2016-03)
    Tsai, Yen-Shing
    ;
    Lin, Bertrand M. T.
    ;
    資訊管理與財務金融系 註：原資管所+財金所
    ;
    Department of Information Management and Finance
    In a two-machine flow shop, the problem seeks to select and schedule jobs such that the processing of the selected jobs does not contain any idle time. The objective is to maximize the number of selected jobs. The problem is studied in the context of a resource-constrained scheduling problem. An O(n(2)) dynamic programming algorithm is proposed. The problem becomes ordinary NP-hard when job weights are introduced. A heuristic is designed and its performance ratio is analysed to be 3.