In make-to-order production systems, manufacturer can have limited capacity and due to the
order delivery time requirements, it may not be possible to accept all orders. This leads to …

This paper studies an order acceptance and scheduling (OAS) problem on unrelated
parallel machines to maximize the total net revenue of accepted orders, which is the …

We study the problem of scheduling jobs on a single machine with a rejection possibility,
concurrently minimizing the total tardiness of the scheduled jobs and the total cost of the …

We study a scheduling problem involving both partitioning and scheduling decisions. A
solution for our problem is defined by (i) partitioning the set of jobs into a set of accepted and …

Decision diagrams (DDs) have proven to be useful tools in combinatorial optimization.
Relaxed DDs represent discrete relaxations of problems, can encode essential structural …

Job shop scheduling with a bank of machines in parallel is important from both theoretical
and practical points of view. Herein we focus on the scheduling problem of minimizing the …

Abstract Machine scheduling is one of the most studied problems due to its technical
challenges and prevalence in real life. In the literature, continuous-and discrete-time …

This paper considers a single machine identical-jobs order scheduling problem with a
position-dependent learning effect (SIOSLE) to minimize the total tardiness. A learning effect …

В последнее время основным способом повышения производительности
вычислительных устройств стало увеличение числа вычислительных ядер в …

Scheduling with rejection is a representative and applied scheduling that emerged around
2000. It is one of the generalizations of the classical scheduling problems. In classical …