This paper surveys the most important algorithmic and computational results on the Vertex
Coloring Problem (VCP) and its generalizations. The first part of the paper introduces the …

Inland waterways form a natural network infrastructure with capacity for more traffic.
Transportation by ship is widely promoted as it is a reliable, efficient and environmental …

This research aims to address scheduling of a single batch processing machine, where jobs
are in different sizes and have a conflicting nature with each other, in the sense that two …

Given a vertex-weighted graph G=(V, E; w), w (v)⩾ 0 for any v∈ V, we consider a weighted
version of the coloring problem which consists in finding a partition S=(S1,…, Sk) of the …

This paper considers a two-stage hybrid flowshop problem in which the first stage contains
several identical discrete machines, and the second stage contains several identical …

We consider a weighted version of the well-known Vertex Coloring Problem (VCP) in which
each vertex i of a graph G has associated a positive weight wi. Like in VCP, one is required …

This paper deals with the problem of task scheduling in a flowshop with two (discrete and
batching) machines. Each task has to be processed by both machines. All tasks visit the …

We consider the Weighted Vertex Coloring Problem (WVCP), in which a positive weight is
associated to each vertex of a graph. In WVCP, one is required to assign a color to each …

In the paper we consider the problem of scheduling n identical jobs on 3 uniform machines
with speeds s 1, s 2, and s 3 to minimize the schedule length. We assume that jobs are …

Given a graph G, we construct an auxiliary graph G̃ with m¯ vertices such that the set of all
stable sets of G̃ is in one-to-one correspondence with the set of all colorings of G. Then, we …