A Resource Minimizing problem with Fuzzy Restricted Processing Time

概要

論文の詳細を見る
This paper investigates a resource minimization scheduling problem with restricted processing times on an identical parallel environment. Up to now, some multi-machine scheduling problems, including identical parallel environments etc.,have concentrated on minimizing make-span under a fixed amount of resources (facilities or machines). However, in real situations, the make-span may be decided by accumulated experiences of experts or desired due-date of customers, etc. So, we treat the make-span with a fixed and prospected constant, and focus on scheduling to minimize resources with a fixed make-span. For solving the problem, a linear time algorithm based on the bin packing problem is proposed and its validity is discussed.