scientific article; zbMATH DE number 4023002
[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.
- Mathematical model of three-dimensional scheduling of technologically linked activities
- The k-track assignment problem
- Network scheduling techniques for construction project management
- Network scheduling problem with cross-docking and loading constraints
- SCHEDULING TWO SALESMEN IN A NETWORK
- scientific article; zbMATH DE number 3843474 (Why is no real title available?)
- Application of digraph theory to process scheduling
- scientific article; zbMATH DE number 3945853 (Why is no real title available?)
- scientific article; zbMATH DE number 15416 (Why is no real title available?)
- scientific article; zbMATH DE number 4123510 (Why is no real title available?)
- Mixed multigraph approach to scheduling jobs on machines of different types∗
- scientific article; zbMATH DE number 1836382 (Why is no real title available?)
- A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs
- scientific article; zbMATH DE number 2203358 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765544)