Makespan minimization in a job shop ...
Florida International University.

 

  • Makespan minimization in a job shop with a batch processing machine.
  • 紀錄類型: 書目-語言資料,印刷品 : Monograph/item
    書名/作者: Makespan minimization in a job shop with a batch processing machine.
    作者: Rojas Santiago, Miguel.
    面頁冊數: 127 p.
    附註: Source: Dissertation Abstracts International, Volume: 71-11, Section: B, page: 7062.
    Contained By: Dissertation Abstracts International71-11B.
    標題: Engineering, Industrial.
    標題: Operations Research.
    ISBN: 9781124299648
    摘要、提要註: A job shop with one batch processing and several discrete machines is analyzed. Given a set of jobs, their process routes, processing requirements, and size, the objective is to schedule the jobs such that the makespan is minimized. The batch processing machine can process a batch of jobs as long as the machine capacity is not violated. The batch processing time is equal to the longest processing job in the batch. The problem under study can be represented as Jm|batch|Cmax. If no batches were formed, the scheduling problem under study reduces to the classical job shop scheduling problem (i.e. Jm|| Cmax), which is known to be NP-hard.
    電子資源: http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3430527
Export
取書館別
 
 
變更密碼
登入