Two-agent scheduling with agent specific batches on an unbounded serial batching machine

We study a scheduling problem, in which jobs of two agents are performed in agent specific batches on the same serial unbounded batching machine. On this machine, jobs of the same batch complete simultaneously, and the batch processing time is equal to the total processing time of its jobs plus a se...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of scheduling Vol. 18; no. 4; pp. 423 - 434
Main Authors:	Kovalyov, Mikhail Y., Oulamara, Ammar, Soukhal, Ameur
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2015 Springer Nature B.V Springer Verlag
Subjects:	Artificial Intelligence Batch processing Business and Management Calculus of Variations and Optimal Control; Optimization Computer Science Consolidation Customers Dynamic programming Functions (mathematics) Hierarchies Logistics Manufacturing Mathematical analysis Operations Research Operations Research/Decision Theory Optimization Polynomials Preventive maintenance Production scheduling Scheduling Serials Studies Supply Chain Management Multi-agent Scheduling Dynamic programming Serial batching machine Distribution center
ISSN:	1094-6136, 1099-1425
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!