No label defined (Q3765544)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4023002
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4023002

      Statements

      1985
      0 references
      scheduling
      0 references
      large scale scheduling problems
      0 references
      [For the entire collection see Zbl 0611.00020.] Each operation of a given set \(N_ k\), \(k=1,...,m\), must be carried out without interruptions by any machine from a given set \(S_ k:\) \(N=\cup^{m}_{k=1}N_ k\), \(N_ k\neq \emptyset\), \(N_ k\cap N_{\ell}=\emptyset\) for \(k\neq \ell\). The scheduling problem, formulated in graph theory terms, calls for an optimal selections of machines from \(S_ k\), \(k=1,...,m\), for operations \(N_ k\), \(k=1,...,m\), to be distributed among the selected machines of type k, and for concurring the time \(t_ i\) for fulfilment of each operation \(i\in N\). The given nondecreasing objective function \(F(s_ 1,s_ 2,...,s_ m,t_ 1,t_ 2,...,t_ n)\) must be minimized. The solution of this problem is reduced to a transformation of a suitable mixed graph. Results demonstrating the possibility of using the network approach to large scale scheduling problems are obtained. An example with \(n=5\), \(m=2\) and \(| S_ 1| =| S_ 2| =2\) is considered.
      0 references

      Identifiers