3. n jobs through 2 machines : Sequencing

Поделиться
HTML-код
  • Опубликовано: 9 янв 2025
  • In this video I discussed the problem of "Find the sequence that minimizes the total elapsed time (in hour) required to completed the following tasks on two machine".
    Job A B C D E F G H I
    Machine 1 2 5 4 9 6 8 7 5 4
    Machine 2 6 8 7 4 3 9 3 8 11
    #sequencing #operationsresearch #njobs2machine #jhonson
    sequencing Problem,
    Johnson Algorithm,
    sequencing and queuing theory,
    sequencing reasoning questions,
    n job 2 machine,
    Johnson Algorithm sequencing Problem ,
    integer Programming in operation research,
    linear programming problems,

Комментарии •