Batch sizing and job sequencing on a single machine
Annals of Operations Research
The complexity of one-machine batching problems
Discrete Applied Mathematics - Special issue on new frontiers in the theory and practice of combinatorial optimization: applications in manufacturing and VLSI design
Nondominated Schedules for a Job-Shop with Two Competing Users
Computational & Mathematical Organization Theory
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
INFORMS Journal on Computing
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Scheduling Problems with Two Competing Agents
Operations Research
Operations Research
A note on the scheduling with two families of jobs
Journal of Scheduling
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Theoretical Computer Science
Flowshop scheduling problem with a batching machine and task compatibilities
Computers and Operations Research
Competitive Two-Agent Scheduling and Its Applications
Operations Research
Scheduling with batching: minimizing the weighted number of tardy jobs
Operations Research Letters
| Hi-index | 0.00 |
We study a scheduling problem, in which two agents compete to perform their jobs on the same serial batching machine. On this machine, jobs of the same batch start and complete simultaneously and the batch processing time is equal to the total processing time of its jobs. Each agent aims at minimizing a function which depends only on the completion times of its jobs. The problem is to find a schedule that minimizes the objective function of one agent, subject to the objective function of the other agent does not exceed a given threshold Q. Polynomial and pseudo-polynomial time algorithms are derived for settings with various combinations of the objective functions.