scientific article; zbMATH DE number 512917
From MaRDI portal
Publication:4281629
Recommendations
Cited in
(15)- Scheduling incompatible tasks on two machines
- Scheduling two jobs with fixed and nonfixed routes
- Scheduling with incompatible jobs
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Multi-coloring and job-scheduling with assignment and incompatibility costs
- Two job cyclic scheduling with incompatibility constraints
- Solution methods for a scheduling problem with incompatibility and precedence constraints
- Scheduling of incompatible jobs on unrelated machines
- Approximation results for the optimum cost chromatic partition problem
- Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
- Approximation algorithms for time constrained scheduling
- On min-max graph balancing with strict negative correlation constraints
- Chromatic cost coloring of weighted bipartite graphs
- Time slot scheduling of compatible jobs
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 Q4281629)