WEAK AND STRONG MACHINE DOMINANCE IN A NONPREEMPTIVE FLOWSHOP

スポンサーリンク

概要

• 論文の詳細を見る
• 2005-03-01

著者

• Vlach Milan

  Charles University

• Cap Petr

  Department Of Theoretical Informatics And Mathematical Logic Charles Uni

• CAP PETR

  Charles University

• CEPEK ONDREJ

  Department of Theoretical Informatics and Mathematical Logic, Charles University

• Cepek Ondrej

  Department Of Theoretical Informatics And Mathematical Logic Charles University

関連論文

• WEAK AND STRONG MACHINE DOMINANCE IN A NONPREEMPTIVE FLOWSHOP
• 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
• 2-C-16 Efficiency and Envy-Freeness in Fair Division Problems with Nonadditive Evaluations
• 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
• Some Classes of Boolean Formulae with Polynomial Time Satisfiability Testing (あいまいさと不確実性を含む状況の数理的意思決定 研究集会報告集)

スポンサーリンク