An algorithm for solving a certain sequencing problem

• Autorzy: A. Adrabiński , J. Grabowski , M. Wodecki
• Języki publikacji: EN

Abstrakty

EN

The authors consider the problem of nonpreemptive scheduling of n tasks in a general job shop. The objective is to find a schedule of minimum length. The algorithm presented in the paper is based on the disjunctive graph approach. Its performance is not compared with other algorithms constructed for that problem.

PL

.

Słowa kluczowe

EN

Scheduling theory, deterministic, Algorithms

• Wydawca: Polish Mathematical Society
• Czasopismo: Mathematica Applicanda
• Rocznik: 1982
• Tom: 10
• Numer: 18

Daty

wydano

1982

online

2016-08-08

Twórcy

autor

A. Adrabiński

autor

J. Grabowski

autor

M. Wodecki

Identyfikatory

DOI

10.14708/ma.v10i18.1523