Parallel machine scheduling is one of the most common studied problems in recent years,
however, this classic optimization problem has to achieve two conflicting objectives, ie …

This work proposes a hybrid algorithm that combines GRASP and Variable Neighborhood
Search for solving a parallel machine scheduling problem with dependent setup times for …

The online shopping center is an electronic commerce where customer orders arrive over
time. The joint online order batching and picker routing is essential for managing online …

Photolithography machine is one of the most expensive equipment in semiconductor
manufacturing system, and as such is often the bottleneck for processing wafers. This paper …

This paper considers the uniform machine scheduling problem with release dates so as to
minimize the total completion time. The problem is known to be NP-hard in the strong sense …

In this paper, we study the online scheduling of linear deteriorating jobs on a single machine
to minimize the total weighted completion time. In the problem, a set of n independent linear …

We consider the online scheduling on a single machine, in which jobs are released over
time and each job can be either accepted and scheduled on the machine or rejected under …

We consider an online stochastic unrelated machines scheduling problem. Specifically, a
set of jobs arriving online over time must be randomly scheduled on the unrelated machines …

We revisit the classical online scheduling problem on parallel machines for minimizing total
weighted completion time. In the problem, a set of independent jobs arriving online over time …

This paper focuses on the photolithography machines scheduling problem in wafer
fabrication factories with the objective of total completion time minimization. The operation …