SINGLE-MACHINE SCHEDULING WITH MIXED PRECEDENCE CONSTRAINTS
スポンサーリンク
概要
- 論文の詳細を見る
The paper deals with a single machine scheduling problem involving a general precedence structure that permits both ordinary and fuzzy precedence constraints. Feasible schedules are evaluated not only by their cost but also by the degree of satisfaction with their precedence structure. An O(mlog n + max(n^2, kn^2))-time algorithm is proposed for finding nondominated solutions of the resulting bi-criteria scheduling problem where n is the number of jobs, k is the number of fuzzy constraints, and m is the total number of precedence constraints.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Vlach Milan
Japan Institute For Science And Technology Hokuriku
-
Vlach M
Hosei Univ.
-
Levner Eugene
Center for Technological Education Holon
関連論文
- Support Vector Machinesによる複数カテゴリの識別
- Scheduling of parallel identical machines to maximize the weighted number
- SINGLE-MACHINE SCHEDULING WITH MIXED PRECEDENCE CONSTRAINTS
- Multiple-choice project scheduling
- Strong pareto optimality of compromise decisions in multi-criteria analysis