This paper considers a batch delivery scheduling problem in which n independent and simultaneously available jobs are to be processed on m unrelated or uniform parallel machines. The jobs scheduled on the same machine are delivered in batches to customers and the delivery date of a batch equals...

Scheduling with learning effects has received lots of research attention lately. However, the multiple-agent setting with learning consideration is relatively limited. On the other hand, the actual processing time of a job under an uncontrolled learning effect will drop to zero precipitously as...

Recently, scheduling with learning effects has received growing attention. A well-known learning model is called 'sum-of processing-times-based learning' where the actual processing time of a job is a non-increasing function of the jobs already processed. However, the actual processing time of a...

Scheduling with learning effects has continued to attract the attention of scheduling researchers. However, the majority of the research on this topic has been focused on the single-machine setting. Moreover, under the commonly adopted learning model in scheduling, the actual processing time of...

This paper investigates some single-machine scheduling problems with a general learning effect and the group technology assumption. A setup time is incurred whenever the single machine transfers job processing from a family to another family. By the general learning effect, we mean that the...

This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each...

We investigate the detailed, empirical analysis of the statistical properties of the Railway Network of China (RNC) in space L and space G, constructed by geographic coarse graining process. The RNC exhibits similar properties in the cumulative distributions of degree and strength in two spaces,...

We consider several two-agent scheduling problems, where agents A and B have to share a single machine while processing their jobs. The objective is to minimize a certain objective function which depends on the completion time of all the jobs, while keeping the objective of agent B (with regard...

This paper considers a new scheduling model in which both two-agents and a time-dependent deterioration exist simultaneously. By the time-dependent deterioration, it means that the actual processing time of a job belonging to the two-agents is defined as a non-decreasing linear function of its...