Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

Miao, Cuixia; Zhang, Yuzhong; Cao, Zhigang

doi:10.1016/j.ipl.2011.05.018

Cited by 26 publications

(12 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, how to design DNA sequences is an important issue to ensure the reliability of DNA computation. In order to make good performance in hybridization reactions, we learn from the sequence design methods in reference [34][35][36][37][38][39][40].…”

Section: Experimental Results Of Simulated Dna Computingmentioning

confidence: 99%

“…The coding programs are used to generate DNA sequences for solving the k-edge cover problem, and construct the DNA sequences of each bit in the library. Meanwhile, when a new DNA sequence is added, the program determines whether the DNA strand meets the constraints listed in the reference [34][35][36][37][38][39][40][41]. If the generated DNA sequence cannot satisfy the constraints, the program will regenerate the new DNA sequence.…”

Section: Experimental Results Of Simulated Dna Computingmentioning

confidence: 99%

See 1 more Smart Citation

A new parallel algorithm to solve one classic water resources optimal allocation problem based on inspired computational model

Ji¹,

Wang²,

Deng³

et al. 2019

Desalination and Water Treatment

View full text Add to dashboard Cite

The shortage of freshwater resources is a serious problem in the process of urbanization in the world, and even become the main constraint factor in some areas. In order to solve the problem, it is imperative to develop an effective, flexible and low-cost water resources management plan. Water resources optimal allocation is one of the hot topics in the field of water resources at present, such as water resources optimal k-edge cover problem. The k-edge cover problem aims to find an edge cover set with k edges in a given undirected graph. The efficient solution of this problem can play an important role in planning and setting up urban water resources network sites. Based on DNA molecular computing, the paper use a new parallel algorithm to solve k-edge cover problem with O(n 2) time complexity, which greatly simplifies the computing complexity.

show abstract

Section: Experimental Results Of Simulated Dna Computingmentioning

confidence: 99%

Section: Experimental Results Of Simulated Dna Computingmentioning

confidence: 99%

A new parallel algorithm to solve one classic water resources optimal allocation problem based on inspired computational model

Ji¹,

Wang²,

Deng³

et al. 2019

Desalination and Water Treatment

View full text Add to dashboard Cite

show abstract

“…Qi et al [33] considered several single p-batch scheduling problems, which involve three objectives for minimizing the maximum cost, the number of tardy jobs, and the total weighted completion time, and they devised the corresponding solving algorithms. Miao et al [24] studied p-batch scheduling problems of deteriorating jobs with identical release dates, and an optimal algorithm and an FPTAS were designed for single-machine case and multiple-machine case, respectively. Pei et al [29] investigated the problem of the s-batch scheduling with deteriorating jobs and an independent constant setup time in an aluminum manufacturing factory for the first time.…”

Section: Introductionmentioning

confidence: 99%

Scheduling family jobs on an unbounded parallel-batch machine to minimize makespan and maximum flow time

Geng¹,

Yuan²

2018

Journal of Industrial &Amp; Management Optimization

View full text Add to dashboard Cite

This paper investigates the scheduling of family jobs with release dates on an unbounded parallel-batch machine. The involved objective functions are makespan and maximum flow time. It was reported in the literature that the single-criterion problem for minimizing makespan is strongly NP-hard when the number of families is arbitrary, and is polynomially solvable when the number of families is fixed. We first show in this paper that the singlecriterion problem for minimizing maximum flow time is also strongly NP-hard when the number of families is arbitrary. We further show that the Pareto optimization problem (also called bicriteria problem) for minimizing makespan and maximum flow time is polynomially solvable when the number of families is fixed, by enumerating all Pareto optimal points in polynomial time. This implies that the single-criterion problem for minimizing maximum flow time is also polynomially solvable when the number of families is fixed.2010 Mathematics Subject Classification. Primary: 58F15, 58F17; Secondary: 53C35.

show abstract

“…Three different algorithms were designed for minimizing the maximum cost, the number of tardy jobs, and the total weighted completion time, respectively. Miao et al (2011) studied the parallel batching scheduling problems with deteriorating jobs. For the case that the jobs have identical release dates, an optimal algorithm and a fully polynomial-time approximation scheme were given for single machine and multiple machines problems, respectively.…”

Section: Introductionmentioning

confidence: 99%

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan

Pei

Pardalos

Liu

et al. 2015

European Journal of Operational Research

View full text Add to dashboard Cite

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

Cited by 26 publications

References 17 publications

A new parallel algorithm to solve one classic water resources optimal allocation problem based on inspired computational model

A new parallel algorithm to solve one classic water resources optimal allocation problem based on inspired computational model

Scheduling family jobs on an unbounded parallel-batch machine to minimize makespan and maximum flow time

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan

Contact Info

Product

Resources

About