Approximation algorithms for scheduling problems with generalized due dates
スポンサーリンク
概要
著者
-
Vlach Milan
School Of Information Science Japan Advanced Institute Of Science And Technology-hokuriku
-
Vlach Milan
School Of Infor
-
Tanaka Keisuke
School of Information Science, Japan Advanced Institute of Science and Technology
-
Tanaka Keisuke
School Of Information Science Japan Advanced Institute Of Science And Technology-hokuriku
-
Tanaka Keisuke
School Of Information Science Japan Advanced Institute Of Science And Technology
関連論文
- On the Negation-Limited Circuit Complexity of Clique Functions
- Minimizing total completion time in a two-machine no-idle flowshop
- Nonpreemtive flowshop scheduling with machine dominance
- Nonpreemtive flowshops with a dominant machine : reductions to single mac
- Single machine scheduling under fuzziness
- Single Machine Scheduling to Minimize the Maximum Lateness with Both Specific and Generalized Due Dates (Special Section of Selected Papers from the 9th Karuizawa Workshop on Circuits and Systems)
- Triangular norms, generalized quasiconcavity and compromise solutions
- SECOND ORDER TANGENT SETS AND OPTIMALITY CONDITIONS
- Second order tangent sets and optimality conditions
- Approximation algorithms for scheduling problems with generalized due dates
- FUZZY CLASSES OF COOPERATIVE GAMES WITH TRANSFERABLE UTILITY
- Scheduling with Fuzzy Delays and Fuzzy Precedences (第16回ファジィシステムシンポジウム--ファジィとノン・ファジィの統合)
- Single-machine sceduling with fuzzy precedence constraints
- Lower bounds of the negation-limited circuit complexity
- A Relationship between the Number of Negations and the Circuit Size
- Concept of linear fuzzy coalitional game