Serial-batching scheduling with two agents to minimize makespan and maximum cost

This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum lateness) of agent B simultaneously. In these two-agent scheduling problems, jobs of different agents cannot be processed in a common batch, and the cost fu...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2020-10, Vol.23 (5), p.609-617
Main Authors: He, Cheng, Xu, Chunqi, Lin, Hao
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Cost function
Employment
Manufacturers
Operations Research/Decision Theory
Optimization
Polynomials
Schedules
Scheduling
Supply Chain Management
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum lateness) of agent B simultaneously. In these two-agent scheduling problems, jobs of different agents cannot be processed in a common batch, and the cost function of an agent depends only on its jobs. For each problem, we present a polynomial-time algorithm which can find all Pareto optimal solutions.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-020-00656-5