THREE-MACHINE SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS

スポンサーリンク

概要

• 論文の詳細を見る

• This paper deals with a three-machine flow-shop problem in which some of the job sequences are infeasible. It is assumed that jobs are grouped into several disjoint subsets within which a job order is pre-determined. Once the first job in a group has started on a machine, then the entire group must be completed on the machine with-out starting a job which does not belong to the group. It is further assumed that a precedence relation between groups is given such that the processing of the jobs in a group must be completed on each machine before the jobs in another group begin on the machine. It is shown that it suffices to consider only permutation schedules for minimizing the total elapsed time and then some restricted cases are solved.

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

著者

• 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

スポンサーリンク