TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS

スポンサーリンク

概要

• 論文の詳細を見る

• In a general two-machine n-job scheduling problem, it is assumed that every possible sequence of jobs can be executed, so that whichever best served a given measure can be selected. This paper considers two more restricted cases in which certain orderings are prohibited, either by technological constraints or by externally imposed policy. In the first case, some of the decisions of a schedule have already been made and the schedule must be completed without altering what has been decided. In the second case, jobs are grouped into disjoint subsets within which a job order is specified, but which May be preempted between jobs. For each of these two cases, a rule is given for determining the sequence in which jobs are to be processed on the machines in order to minimize the total elapsed time.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Kurisu Tadashi

  Department Of Applied Physics Faculty Of Engineering Osaka University

関連論文

• TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
• TWO-PERSON ZERO-SUM GAMES WITH RANDOM PAYOFFS
• THREE-MACHINE SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
• A TWO-VERSUS-ONE SILENT DUEL WITH EQUAL ACCURACY FUNCTIONS UNDER ARBITRARY MOTION
• A TWO-VS.-TWO SILENT DUEL WITH EQUAL ACCURACY FUNCTIONS UNDER ARBITRARY MOTION
• A ONE-NOISY-VERSUS-TWO-SILENT DUEL WITH ARBITRARY ACCURACY FUNCTIONS UNDER ARBITRARY MOTION
• NOISY-VS.-SILENT DUEL WITH ARBITRARY ACCURACY FUNCTIONS UNDER ARBITRARY MOTION

スポンサーリンク