Parallel Machine Scheduling with Minimal and Maximal Time Lags for Reentrant Job
碩士 === 國立中央大學 === 工業管理研究所 === 95 === In this paper we study the problem of scheduling recirculation jobs on identical parallel machines with eligibility and availability restrictions when minimizing the makespan. Namely, each job may visit a machine more than once and is only allowed to be processed...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/87573722329193258185 |