Scheduling problems are combinatorial optimization problems in which some activities have
to be executed using resources that they need. A feasible allocation of the resources to the …

In this paper we give a survey of the most important results on multicriteria scheduling that
have appeared in the literature or are to appear. We provide an extensive introduction …

In classical deterministic scheduling problems, the job processing times are assumed to be
constant parameters. In many practical cases, however, processing times are controllable by …

We consider several two-agent scheduling problems with controllable job processing times,
where agents A and B have to share either a single machine or two identical machines in …

This paper reviews the problems of Boolean non-linear programming related to the half-
product problem. All problems under consideration have a similar quadratic non-separable …

This paper reviews two problems of Boolean non-linear programming: the Symmetric
Quadratic Knapsack Problem and the Half-Product Problem. The problems are related since …

We consider resource allocation scheduling with learning effect in which the processing time
of a job is a function of its position in a sequence and its resource allocation. The objective is …

This paper considers the identical parallel machine scheduling problem to minimize the
makespan with controllable processing times, in which the processing times are linear …

We study the earliness-tardiness scheduling problem on a single machine with due date
assignment and controllable processing times. We analyze the problem with three different …

In the traditional scheduling problems, it is always assumed that any job has to be
processed and the processing time is pre-given and fixed. In this paper, we address the …