Filters








179,248 Hits in 4.0 sec

A Novel Fast Parallel Batch Scheduling Algorithm for Solving the Independent Job Problem

Zhang, Wu, Song, Liu, Xiong
2020 Applied Sciences  
The processing time of a batch is determined by the longest of all the jobs processed in the batch. A novel and fast 4.5-approximation algorithm is developed for the above scheduling problem.  ...  For the special case of all the jobs having the same processing times, a simple and fast 2-approximation algorithm is achieved.  ...  In Section 4, a novel fast 4.5-approximation algorithm is proposed for problem P s j , p − batch, K i C max .  ... 
doi:10.3390/app10020460 fatcat:vhidxjxjxrgdrdqdalw3fs4nyq

The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Q.Q. Nong, C.T. Ng, T.C.E. Cheng
2008 Operations Research Letters  
One is the identical job size model, in which the machine can process up to b jobs simultaneously as a batch.  ...  In this paper we first present a 2-approximation algorithm for the former model and a polynomial time approximation scheme (PTAS) for the case when the number of distinct families is constant; and then  ...  Acknowledgements This research was supported in part by The Hong Kong Polytechnic University under grant number A628 from the Area of Strategic Development in China Business Services.  ... 
doi:10.1016/j.orl.2007.01.007 fatcat:ck3mxkc6znecvhxghet2b5qyja

Minimizing the makespan on a single parallel batching machine

Shenpeng Lu, Haodi Feng, Xiuqian Li
2010 Theoretical Computer Science  
In this paper, we consider the problem of scheduling with release dates and rejection on a single parallel batching machine, where the jobs have non-identical sizes.  ...  First, we give a polynomial time approximation scheme (PTAS) for the case where jobs can be split. Then, we propose a 2-approximation algorithm for the special case with identical release dates.  ...  The processing time of a batch is the longest processing time of any job in the batch. Jobs processed in the same batch have the same start time and the same completion time.  ... 
doi:10.1016/j.tcs.2009.12.008 fatcat:6ogkhsl4ubgu3mhj6zdi6wcqne

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs [chapter]

Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2006 Lecture Notes in Computer Science  
For the first variant, we show that an adaptation of the greedy set cover algorithm gives a 4-approximation for perfect graphs.  ...  In the p-batch set of problems, the length of a batch is defined as the maximum processing time of any job in the batch.  ...  A batch is completed when the last job in the batch finishes its processing, and all the jobs in a batch terminate once the batch is completed.  ... 
doi:10.1007/11830924_13 fatcat:4atvwazygfhx7mipfmyawit6qm

Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai
2007 Algorithmica  
For the first variant, we show that an adaptation of the greedy set cover algorithm gives a 4-approximation for perfect graphs.  ...  In the p-batch set of problems, the length of a batch is defined as the maximum processing time of any job in the batch.  ...  A batch is completed when the last job in the batch finishes its processing, and all the jobs in a batch terminate once the batch is completed.  ... 
doi:10.1007/s00453-007-9161-z fatcat:o5aqd53nojei5gskl7oagwxh3y

Approximation of the k-batch consolidation problem

Sung-Pil Hong, Myoung-Ju Park, Soo Y. Chang
2009 Theoretical Computer Science  
This batch consolidation problem is motivated by the production system typical in raw material industries in which multiple items can be processed in the same batch if they share sufficiently close production  ...  If the number of items processed in a batch is restricted to being up to some fixed integer k, the problem is referred to as the k-batch consolidation problem.  ...  Acknowledgement The second author's research was partially supported by the Second Stage of Brain Korea 21 Project in 2008.  ... 
doi:10.1016/j.tcs.2008.11.007 fatcat:3surhrh2urb6lawjw6qymdtdhu

Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

Cuixia Miao
2014 Abstract and Applied Analysis  
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model ispj=aj+αtand of the second model ispj=a+αjt.  ...  We presentO(n log n)time algorithms for the single-machine problems, respectively.  ...  A family approximation algorithm { } is a fully polynomialtime approximation scheme (FPTAS) if, for each > 0, the algorithm is a (1 + )algorithm that is polynomial in the input size and in 1/ .  ... 
doi:10.1155/2014/495187 fatcat:j6sfmkrfrvaxpoziarmlqup2fq

Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations

Xuefei Shi, Dehua Xu
2014 The Scientific World Journal  
algorithm for the caseb>1and that the FFD-LS algorithm, which is proposed in the literature, is the best possible algorithm for the caseb≤1both from the worst-case bound point of view.  ...  We propose an approximation algorithm named FFD-LS2I with a worst-case bound of 2 for problem.  ...  Acknowledgments This research was supported in part by the National Natural Science Foundation of China (71201022) and the Natural Science Foundation of Jiangxi Province (20122BAB201010).  ... 
doi:10.1155/2014/547573 pmid:24701177 pmcid:PMC3950368 fatcat:4cfr4bublbfyhamv6v7o4f3kia

Bounded single-machine parallel-batch scheduling with release dates and rejection

Lingfa Lu, T.C.E. Cheng, Jinjiang Yuan, Liqi Zhang
2009 Computers & Operations Research  
A job is either rejected, in which case a certain penalty has to be paid, or accepted and then processed on the machine.  ...  For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme.  ...  Yuan and Lu were also supported in part by grants NSFC (10671183) and NFSC-RGC (70731160633).  ... 
doi:10.1016/j.cor.2008.12.003 fatcat:ju3y4aakebdcbo34n3fx3v3oky

Integrated Scheduling Problem on a Single Bounded Batch Machine with an Unavailability Constraint

Jing Fan, Chin-Chia Wu
2020 Discrete Dynamics in Nature and Society  
We show that these four problems are NP-hard in the strong sense in which the jobs have the same processing times and arbitrary sizes, and we propose an approximation algorithm for solving these four problems  ...  In the second class, the parallel-batch machine, the processing time of a batch is the maximum processing time of the jobs contained in the batch.  ...  the branch-and-bound algorithm for the binpacking problem in [27] and delivering as (4) in Lemma 1. e approximation algorithm and the branch-andbound algorithm are coded in VC++, and the computational  ... 
doi:10.1155/2020/8625849 fatcat:p5xeyuoqcffy7nlbkyalfkyks4

Approximation of a batch consolidation problem

Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park
2010 Networks  
In batch production systems, multiple items can be processed in the same batch if they share sufficiently similar production parameters.  ...  This article focuses on the case in which only one or two items can be processed in a single batch.  ...  in the batch and by the demands of the items processed in it.  ... 
doi:10.1002/net.20409 fatcat:gjapr72pwjbszop5yuejqpmkpy

Approximation for Batching via Priorities

W. Bein, J. Noga, J. Wiegley
2007 Scientific Annals of Computer Science  
We give an approximation algorithm with approximation ratio of $2$; the algorithm is a priority algorithm, which batches jobs in decreasing order of priority.  ...  Batching has wide application in manufacturing, decision management, and scheduling in information technology.  ...  In that case, the length of a batch is the maximum of the processing times of its jobs. Figure 2 gives an example of a p-batch schedule.  ... 
doaj:1ab68aa57700455fbbd9d47548257bd9 fatcat:kyxvwdatt5ehxhlkvewcb25smy

Single-Machine Parallel-Batch Scheduling with Nonidentical Job Sizes and Rejection

Miaomiao Jin, Xiaoxia Liu, Wenchang Luo
2020 Mathematics  
In this problem, a set of jobs with different processing times and nonidentical sizes is given to be possibly processed on a parallel-batch processing machine.  ...  Then, we propose three fast heuristic algorithms to solve the problem and evaluate their performances by using a small numerical example.  ...  The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript, or in the decision to publish the results.  ... 
doi:10.3390/math8020258 fatcat:hof6rtwdifcnnjk44usn2lvbxm

Page 285 of Neural Computation Vol. 6, Issue 2 [page]

1994 Neural Computation  
Using stochastic approximation results, we show that for 7 — 0 this training process approaches a batch training.  ...  Using this approximation we indicate the reasons why simple backpropagation is less likely to get stuck in local minima than the batch training process and demonstrate this empirically on a number of examples  ... 

Robust State Estimation for Fouling Evolution in Batch Processes using the EM Algorithm

Ouyang Wu, Lars Imsland, Edmund Brekke, Stefan M. Schneider, Ala E.F. Bouaswaig, Matthias Roth
2019 IFAC-PapersOnLine  
This paper focuses on the state estimation of fouling in a multipurpose batch process, and the problem is formulated using an industrial case study.  ...  This paper focuses on the state estimation of fouling in a multipurpose batch process, and the problem is formulated using an industrial case study.  ...  Keywords: Batch-to-batch fouling, EM algorithm, T-distribution, Variational approximation INTRODUCTION In process industries, it is inevitable that the performances of the plants degrade during their  ... 
doi:10.1016/j.ifacol.2019.06.142 fatcat:i3z4ysrd2bbqrpxicdxvozjo5e
« Previous Showing results 1 — 15 out of 179,248 results