Two-Agent Scheduling on an Unbounded Serial Batching Machine
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.
KeywordsScheduling Serial batching machine Multi-agent Complexity Dynamic Programming
Unable to display preview. Download preview PDF.
- 4.Agnetis, A., Pacciarelli, D., Pacifici, A.: Combinatorial models for multi agent scheduling problems. In: Levner, E. (ed.) Multiprocessor Scheduling, Theory and Applications, pp. 21–46. I-Tech Education and Publishing, Vienna (2008) ISBN 978-3-902613-02-8Google Scholar
- 9.Cheng, T.C.E., Kovalyov, M.Y.: Single machine batch scheduling with sequential job processing. IIE Transactions 33, 413–420 (2001)Google Scholar
- 13.Gavranovic, H., Finke, G.: Graph partitioning and set covering for optimal design of production system in the metal industry. In: Proceedings of the second Conference on Management and Control of Production and Logistics - MCPL 2000, Grenoble (2000)Google Scholar
- 22.Oulamara, A., Kovalyov, M.Y., Finke, G.: Scheduling a no-wait flowshop with unbounded batching machines. IIE Transactions on Scheduling and logistics 37, 685–696 (2005)Google Scholar
- 24.Potts, C.N., Van Wassenhove, L.N.: Integrating scheduling with batching and lotsizing: A review of algorithms and complexity. Operations Research Society 42, 395–406 (1992)Google Scholar
- 26.T’kindt, V., Billaut, J.-C.: Multicriteria Scheduling: Theory, Models and Algorithms, 2nd edn. Springer (2006)Google Scholar