JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS
スポンサーリンク
概要
- 論文の詳細を見る
- 2004-09-01
著者
-
Cepek Ondrej
Department Of Theoretical Informatics And Mathematical Logic Charles University
-
SUNG Shao
School of Information Science, Japan Advanced Institute of Science and Technology
-
Sung Shao
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Sung Shao
School Of Information Sc
関連論文
- WEAK AND STRONG MACHINE DOMINANCE IN A NONPREEMPTIVE FLOWSHOP
- Minimizing total completion time in a two-machine no-idle flowshop
- Nonpreemtive flowshops with a dominant machine : reductions to single mac
- Coterie for Generalized Mutual Exclusion Problem
- Multiple-choice project scheduling
- A procedure for competitive fair division
- Competitive Envy-Free Division
- Scheduling with Fuzzy Delays and Fuzzy Precedences (第16回ファジィシステムシンポジウム--ファジィとノン・ファジィの統合)
- Parallelization of Quantum Circuits with Ancillae (Special Issue on Selected Papers from LA Symposium)
- A Quadratic Time Algorithm to Maximize the Number of Just-in-Time Jobs on Identical Parallel Machines
- JUST-IN-TIME SCHEDULING WITH PERIODIC TIME SLOTS
- Just-in-Time Scheduling with Periodic Time Slots
- Providing a framework for conflict resolution
- Some Classes of Boolean Formulae with Polynomial Time Satisfiability Testing (あいまいさと不確実性を含む状況の数理的意思決定 研究集会報告集)