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 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 A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives

2013 ◽  
Vol 37 (10-11) ◽  
pp. 7071-7076 ◽  
Author(s):  
Qi Feng ◽  
Jinjiang Yuan ◽  
Hailing Liu ◽  
Cheng He
Keyword(s):  
Maximum Lateness ◽  
Parallel Batching ◽  
Agent Scheduling ◽  
Batching Machine

scholarly journals Parallel Batch Scheduling of Deteriorating Jobs with Release Dates and Rejection

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Juan Zou ◽  
Cuixia Miao
Keyword(s):  
Approximation Scheme ◽  
Deteriorating Jobs ◽  
Time Algorithm ◽  
Batch Scheduling ◽  
Release Dates ◽  
Ordinary Sense ◽  
Starting Time ◽  
Total Penalty ◽  
Batching Machine ◽  
Increasing Function

We consider the unbounded parallel batch scheduling with deterioration, release dates, and rejection. Each job is either accepted and processed on a single batching machine, or rejected by paying penalties. The processing time of a job is a simple linear increasing function of its starting time. The objective is to minimize the sum of the makespan of the accepted jobs and the total penalty of the rejected jobs. First, we show that the problem is NP-hard in the ordinary sense. Then, we present two pseudopolynomial time algorithms and a fully polynomial-time approximation scheme to solve this problem. Furthermore, we provide an optimalO(nlog⁡n)time algorithm for the case where jobs have identical release dates.

Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue

2018 ◽  
Vol 70 (10) ◽  
pp. 1830-1847 ◽  
Author(s):  
Jun Pei ◽  
Xingming Wang ◽  
Wenjuan Fan ◽  
Panos M. Pardalos ◽  
Xinbao Liu
Keyword(s):  
Deteriorating Jobs ◽  
Parallel Batching ◽  
Net Revenue

Two-Agent Scheduling on an Unbounded Serial Batching Machine

2012 ◽  
pp. 427-438 ◽  
Author(s):  
Mikhail Y. Kovalyov ◽  
Ammar Oulamara ◽  
Ameur Soukhal
Keyword(s):  
Agent Scheduling ◽  
Batching Machine
Sign in / Sign up

Export Citation Format

Share Document