This paper considers coordinated scheduling on parallel identical machines with batch delivery. Jobs are first processed on m parallel and identical machines in the manufacturing facility and then delivered to the customer in batches. There are v identical transporters that can carry up to c...

In this paper, we study the problem of minimizing the maximum total completion time per machine on m parallel and identical machines. We prove that the problem is strongly NP-hard if m is a part of the input. When m is a given number, a pseudo-polynomial time dynamic programming is proposed. We...

A single-machine scheduling problem with workload-dependent maintenance duration is considered. The objective is to minimize total completion time. For the case where the derivation of the maintenance duration function is greater than or equal to 1, a polynomial time optimal algorithm is...

We consider the online bounded-batch scheduling to minimize total weighted completion time on parallel machines. In the problem, a set of n independent jobs arriving online over time has to be scheduled on m given machines, where the information of each job including its processing time and...

The note deals with machine scheduling problems with a more general learning effect model, i.e., the actual job processing time is a function of the sum of the function of the processing times of the jobs already processed and job position. We show that some single machine scheduling problems...

This paper considers the scheduling problems with the objective of minimizing the total completion time on two parallel identical machines with given unavailable periods. The jobs are assumed to be nonresumable. If there is one unavailable period on one of the two machines, we prove that SPT has...

In this paper, we investigate the capacitated two-parallel machines scheduling problem, where one machine is only available for a special period of time after which it can no longer process any job while the other machine is continuously available. Our objective is to minimize the completion...

This paper considers a parallel-machine scheduling problem with machine maintenance. There are unavailable periods on each of the first k machines, and the remaining m - k machines are always available, where 1 [less-than-or-equals, slant] k [less-than-or-equals, slant] m is an...