In this study, we consider a relatively new class of the customer order scheduling (COS) problem where each order consists of one or more individual jobs. All jobs in the same customer order are processed successively and ...

In the literature of the parallel machines scheduling, it is generally assumed that all machines are continuously available for processing jobs and each job can be processed by any machine. However, these assumptions become ...