We consider an extension of classic parallel machine scheduling where a set of jobs is
scheduled on identical parallel machines and an undirected conflict graph is part of the …

This paper addresses the problem of scheduling n identical jobs on a set of m parallel
uniform machines. The jobs are subjected to conflicting constraints modelled by an …

In the NP-hard Max $ c $-Cut problem, one is given an undirected edge-weighted graph $ G
$ and aims to color the vertices of $ G $ with $ c $ colors such that the total weight of edges …

This paper deals with the problem of scheduling a set of unit‐time jobs on a set of uniform
machines. The jobs are subject to conflict constraints modeled by a graph G called the …

In this paper, the problem of scheduling commercial messages during the peak of viewing
time of a TV channel is formulated as a combinatorial auction-based mathematical …

Advertisements are a key source of revenue for companies in the broadcasting and web
industries. However, because of increasing competition, advertisers and web publishers …

The problem of scheduling the commercial advertisements in the television industry is
investigated. Each advertiser client demands that the multiple airings of the same brand …

This paper describes a Decision Support System (DSS) that aims to plan and maintain the
weekly self-promotion space for an over the air TV station. The self-promotion plan requires …

Professional service firms have had an impressive growth in the last years and are very
influential on setting managerial practices at manufacturing and service firms. However …

This paper deals in the first place with the problems of two-equitable colouring of a union of
complete bipartite graphs and three-equitable colouring of connected bipartite graphs …