Abstract
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. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Kovalyov, M. Y., Oulamara, A., & Soukhal, A. (2012). Two-agent scheduling on an unbounded serial batching machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7422 LNCS, pp. 427–438). https://doi.org/10.1007/978-3-642-32147-4_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
