TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS

スポンサーリンク

概要

• 論文の詳細を見る

• Suppose jobs, in the Johnson's two-machine n-job flow-shop scheduling problem, are grouped into disjoint subsets within which a job order that may not be preempted is specified. Furthermore, suppose that a precedence relation between these subsets is given such that the processing of a subset must be completed, on each machine, before the processing of another subset begins on the machine. This paper considers a problem to find a sequence in which jobs are to be processed on the machines in order to minimize the total elapsed time, under such general precedence constraints, from the start of the first job on machine I until the end of the last job on machine II. An efficient algorithm to obtain an optimal sequence is given and a simple example is shown.

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

著者

• 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

スポンサーリンク