Unbounded parallel-batching scheduling with two competitive agents

Authors:
Shisheng Li;Jinjiang Yuan
Affiliations:
Department of Mathematics, Zhengzhou University, Zhengzhou, PR China 450001;Department of Mathematics, Zhengzhou University, Zhengzhou, PR China 450001
Venue:
Journal of Scheduling
Year:
2012

Citing 11
Cited 2

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
The Batch Loading and Scheduling Problem

Operations Research
A Multiple-Criterion Model for Machine Scheduling

Journal of Scheduling
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan

Theoretical Computer Science
Scheduling Problems with Two Competing Agents

Operations Research
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs

Theoretical Computer Science
Scheduling Algorithms

Scheduling Algorithms
A Lagrangian approach to single-machine scheduling problems with two competing agents

Journal of Scheduling
Competitive Two-Agent Scheduling and Its Applications

Operations Research
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Operations Research Letters
Improved dynamic programs for some batching problems involving the maximum lateness criterion

Operations Research Letters

Scheduling problems with two competing agents to minimized weighted earliness-tardiness

Computers and Operations Research
Bounded parallel-batching scheduling with two competing agents

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 machine can process any number of jobs simultaneously in a batch. The processing time of a batch is equal to the maximum processing time of the jobs in the batch. Two main categories of batch processing based on the compatibility of job families or agents are distinguished. In the case where job families are incompatible, jobs from different families cannot be placed in the same processing batch while all jobs can be placed in the same processing batch when job families are compatible. The goal is to find a schedule for all jobs of the two agents that minimizes the objective of one agent while keeping the objective of the other agent below or at a fixed value Q. Polynomial-time and pseudo-polynomial-time algorithms are provided to solve various combinations of regular objective functions for the scenario in which job families are either incompatible or compatible.