• Publications
  • Influence
Parallel-machine scheduling with deteriorating jobs and rejection
We consider several parallel-machine scheduling problems in which the processing time of a job is a (simple) linear increasing function of its starting time and jobs can be rejected by payingExpand
  • 38
  • 3
  • PDF
Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
This paper considers the problem of scheduling deteriorating jobs and due date assignment on a single machine. The actual processing time of a job is a linear increasing function of its startingExpand
  • 43
  • 2
Vectorization for Java
Java is one of the most popular programming languages in today's software development, but the adoption of Java in some areas like high performance computing, gaming, and media processing is not asExpand
  • 18
  • 2
  • PDF
Unbounded parallel-batching scheduling with two competitive agents
We consider the scheduling problems arising when two agents, each with a family of jobs, compete to perform their respective jobs on a common unbounded parallel-batching machine. The batching machineExpand
  • 61
  • 1
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
We consider the problem of scheduling n deteriorating jobs with release dates on a single batching machine. Each job's processing time is an increasing simple linear function of its starting time.Expand
  • 53
  • 1
Group scheduling and due date assignment on a single machine
We consider a single-machine scheduling problem involving both the due date assignment and job scheduling under a group technology environment. The jobs (orders) of customers are classified intoExpand
  • 28
  • 1
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
We consider the scheduling of n family jobs with release dates on m identical parallel batching machines. Each batching machine can process up to b jobs simultaneously as a batch. In the boundedExpand
  • 15
  • 1
Preemptive scheduling with simple linear deterioration on a single machine
In this paper we study the problem of scheduling n deteriorating jobs with release dates on a single machine. The processing time of a job is assumed to be the product of its deteriorating rate andExpand
  • 16
  • 1
Single-Machine Scheduling with Proportionally deteriorating Jobs subject to Availability Constraints
We address the nonresumable version of the scheduling problem with proportionally deteriorating jobs on a single machine subject to availability constraints. The objective is to minimize the totalExpand
  • 11
  • 1
Study on Parallel Machine Scheduling Problem with Buffer
In the papers by Kellerer et al. (1995) and Zhang (1997) the authors investigate a semi on-line version of a classical parallel machine scheduling problem. In the semi on-line version, there is aExpand
  • 5
  • 1