An algorithm for solving a certain sequencing problem

A. Adrabiński, J. Grabowski, and M. Wodecki. "An algorithm for solving a certain sequencing problem." Mathematica Applicanda 10.18 (1982): null. <http://eudml.org/doc/293246>.

@article{A1982,
abstract = {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.},
author = {A. Adrabiński, J. Grabowski, M. Wodecki},
journal = {Mathematica Applicanda},
keywords = {Scheduling theory, deterministic, Algorithms},
language = {eng},
number = {18},
pages = {null},
title = {An algorithm for solving a certain sequencing problem},
url = {http://eudml.org/doc/293246},
volume = {10},
year = {1982},
}

TY - JOUR
AU - A. Adrabiński
AU - J. Grabowski
AU - M. Wodecki
TI - An algorithm for solving a certain sequencing problem
JO - Mathematica Applicanda
PY - 1982
VL - 10
IS - 18
SP - null
AB - 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.
LA - eng
KW - Scheduling theory, deterministic, Algorithms
UR - http://eudml.org/doc/293246
ER -