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

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.

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

scholarly journals Scheduling and Common Due Date Assignment on a Single Parallel-Batching Machine with Batch Delivery

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Hua Gong ◽  
Biao Zhang ◽  
Wuliang Peng
Keyword(s):  
Processing Time ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Parallel Batching ◽  
Batch Delivery ◽  
Delivery Date ◽  
Special Cases ◽  
Batching Machine ◽  
Production Part

We consider a single parallel-batching machine scheduling problem with delivery involving both batching scheduling and common due date assignment. The orders are first processed on the single parallel-batching machine and then delivered in batches to the customers. The batching machine can process several orders at the same time. The processing time of a production batch on the machine is equal to the longest processing time of the orders assigned into this batch. A common due date for all the orders in the same delivery batch and a delivery date for each order need to be determined in order to minimize total weighted flow time. We first prove that this problem is NP hard in the strong sense. Two optimal algorithms by using dynamic programming are derived for the two special cases with a given sequence of orders on the machine and a given batching in the production part, respectively.

Sign in / Sign up

Export Citation Format

Share Document