Usually, scheduling relates to the sequencing and timing of jobs in the production system to
optimize some performance measures. The most used are makespan, total completion time …

The customer order scheduling problem (COSP) is defined as to determine the sequence of
tasks to satisfy the demand of customers who order several types of products produced on a …

In this paper we study the scheduling problem in which each customer order consists of
several jobs of different types, which are to be processed on m facilities. Each facility is …

The customer order scheduling problem has received much attention recently due to its
relevance to real world applications. In this study, the minimization of the total completion …

This study considers a customer order scheduling (COS) problem in which each customer
requests a variety of products (jobs) processed on a single flexible machine, such as the …

The focus of this paper is customer order scheduling (COS) problem, where each order
consists of a set of jobs that must be shipped as one batch at the same time. In COS each …

In this study, the customer order scheduling problem is investigated to minimize total
weighted completion time. A quadratic formulation is proposed to address this problem. This …

In this paper, we study a customer order scheduling problem where a number of orders,
composed of several product types, have to be scheduled on a set of parallel machines …

The problem addressed in this paper belongs to the topic of order scheduling, in which
customer orders–composed of different individual jobs–are scheduled so the objective …

In this paper, we study a variant of the customer order scheduling problem when sequence-
dependent setup times cannot be ignored. The performance measure adopted is the …