Pages that link to "Item:Q2476244"
From MaRDI portal
The following pages link to Batch processing with interval graph compatibilities between tasks (Q2476244):
Displayed 32 items.
- The lockmaster's problem (Q322695) (← links)
- On the max-weight edge coloring problem (Q613668) (← links)
- On the max coloring problem (Q690449) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- Capacitated max-batching with interval graph compatibilities (Q899311) (← links)
- Partitioning a weighted partial order (Q927191) (← links)
- Flowshop scheduling problem with a batching machine and task compatibilities (Q954038) (← links)
- On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
- Approximating the max-edge-coloring problem (Q986540) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- The vertex coloring problem and its generalizations (Q1022440) (← links)
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities (Q1679513) (← links)
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines (Q1686064) (← links)
- Improved approximation algorithms for the max edge-coloring problem (Q1944142) (← links)
- A PTAS for the horizontal rectangle stabbing problem (Q2164717) (← links)
- Clique partitioning with value-monotone submodular cost (Q2339847) (← links)
- Single-machine batch scheduling with job processing time compatibility (Q2342681) (← links)
- Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs (Q2410362) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- Bounded max-colorings of graphs (Q2447538) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- (Q2861568) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Clique partitioning of interval graphs with submodular costs on the cliques (Q3004202) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN (Q3074794) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- (Q5091054) (← links)