Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents’ makespans

2018 ◽  
Vol 10 (3) ◽  
pp. 999-1007 ◽  
Author(s):  
Cui-Lin Zhang ◽  
Jun-Qiang Wang ◽  
Cheng-Wu Zhang
Keyword(s):  
Weighted Sum ◽  
Parallel Batching ◽  
Agent Scheduling ◽  
Batching Machine

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

2017 ◽  
Vol 258 (2) ◽  
pp. 478-490 ◽  
Author(s):  
Jun-Qiang Wang ◽  
Guo-Qiang Fan ◽  
Yingqian Zhang ◽  
Cheng-Wu Zhang ◽  
Joseph Y.-T. Leung
Keyword(s):  
Processing Time ◽  
Parallel Batching ◽  
Agent Scheduling ◽  
Batching Machine

scholarly journals Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine

2017 ◽  
Vol 263 (2) ◽  
pp. 401-411 ◽  
Author(s):  
Lixin Tang ◽  
Xiaoli Zhao ◽  
Jiyin Liu ◽  
Joseph Y.-T. Leung
Keyword(s):  
Deteriorating Jobs ◽  
Parallel Batching ◽  
Agent Scheduling ◽  
Batching Machine

Two-agent scheduling on a single sequential and compatible batching machine

2017 ◽  
Vol 64 (8) ◽  
pp. 628-641 ◽  
Author(s):  
Shisheng Li ◽  
T.C.E. Cheng ◽  
C.T. Ng ◽  
Jinjiang Yuan
Keyword(s):  
Agent Scheduling ◽  
Batching Machine

BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN

2014 ◽  
Vol 31 (04) ◽  
pp. 1450025 ◽  
Author(s):  
CHENG HE ◽  
HAO LIN ◽  
JINJIANG YUAN ◽  
YUNDONG MU
Keyword(s):  
Processing Time ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Pareto Optimal ◽  
Pareto Optimal Solutions ◽  
Optimal Solutions ◽  
Maximum Cost ◽  
Parallel Batching ◽  
Multicriteria Problem ◽  
Batching Machine

In this paper, the problem of minimizing maximum cost and makespan simultaneously on an unbounded parallel-batching machine is considered. An unbounded parallel-batching machine is a machine that can handle any number of jobs in a batch and the processing time of a batch is the largest processing time of jobs in the batch. The main goal of a multicriteria problem is to find Pareto optimal solutions. We present a polynomial-time algorithm to produce all Pareto optimal solutions of this bicriteria scheduling problem.

Sign in / Sign up

Export Citation Format

Share Document