Job scheduling and resource allocation in parallel‐machine system via a hybrid nested partition method

Fu, Yaping; Jiang, Guanjie; Tian, Guangdong; Wang, Zhenling

doi:10.1002/tee.22842

Cited by 6 publications

(5 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…r ik the required amount of resource that job i is processed in mode k. p ik the processing time of job i is processed in mode k. applied to solve many complex optimization problems, for example, traveling salesman problem, 43 buffer allocation problem, 44 product design problem, 45 and production scheduling problems. 46,47 Basic algorithm framework…”

Section: Solution Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A meta-heuristic algorithm for integrated optimization of dynamic resource allocation planning and production scheduling in parallel machine system

Wang

2019

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

With the wide application of advanced information technology and intelligent equipment in the manufacturing system, the decisions of design and operation have become more interdependent and their integration optimization has gained great concerns from the community of operational research recently. This article investigates an optimization problem of integrating dynamic resource allocation and production schedule in a parallel machine environment. A meta-heuristic algorithm, in which heuristic-based partition, genetic-based sampling, promising index calculation, and backtracking strategies are employed, is proposed for solving the investigated integration problem in order to minimize the makespan of the manufacturing system. The experimental results on a set of random-generated test instances indicate that the presented model is effective and the proposed algorithm exhibits the satisfactory performance that outperforms two stateof-the-art algorithms from literature.

show abstract

Section: Solution Methodsmentioning

confidence: 99%

“…applied to solve many complex optimization problems, for example, traveling salesman problem, 43 buffer allocation problem, 44 product design problem, 45 and production scheduling problems. 46,47 Basic algorithm framework…”

Section: Solution Methodsmentioning

confidence: 99%

A meta-heuristic algorithm for integrated optimization of dynamic resource allocation planning and production scheduling in parallel machine system

Wang

2019

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…Results show that the proposed method outperforms the methods proposed by Daniels et al (1997) in terms of computational time and solution quality. In Fu, Jiang, Tian, & Wang (2019b) , the authors consider the same problem, but propose a hybrid NPM. Similarly, compared to the methods of Daniels et al (1997) , their proposed solution method shows better results.…”

Section: Scheduling With Speeding-up Resource Typesmentioning

confidence: 99%

Production, maintenance and resource scheduling: A review

Geurtsen

Didden

Adan

et al. 2023

European Journal of Operational Research

View full text Add to dashboard Cite

“…Gyorgyi, Peter (2017) propose a polynomial time approximation scheme to solve the UPMR with non-renewable resource constraints. Fu, Y., Jiang, G., Tian, G., et al (2019) design a constructive heuristic approach and a hybrid nested partition method to fix the UPS where the resource needs to be allocated to machines in advance. Fanjul-Peyro, L., Perea, F., Ruiz, Rubén (2017) uses the ideas obtained from bin packing problem and propose matheuristic strategies.…”

Section: : Literature Reviewmentioning

confidence: 99%

Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem

Xie

Yang

2020

J Intell Manuf

View full text Add to dashboard Cite

In this paper we focus on an unrelated parallel workgroup scheduling problem where each workgroup is composed of a number of personnel with similar work skills which has eligibility and human resource constraints. The most difference from the general unrelated parallel machine scheduling with resource constraints is that one workgroup can process multiple jobs at a time as long as the resources are available, which means that a feasible scheduling scheme is impossible to get if we consider the processing sequence of jobs only in time dimension. We construct this problem as an integer programming model with the objective of minimizing makespan. As it is incapable to get the optimal solution in the acceptable time for the presented model by exact algorithm, meta-heuristic is considered to design. A pure genetic algorithm based on special coding design is proposed firstly. Then a hybrid genetic algorithm based on bin packing strategy is further developed by the consideration of transforming the single workgroup scheduling to a strip-packing problem. Finally, the proposed algorithms, together with exact approach, are tested at different size of instances. Results demonstrate that the proposed hybrid genetic algorithm shows the effective performance.

show abstract

Job scheduling and resource allocation in parallel‐machine system via a hybrid nested partition method

Cited by 6 publications

References 33 publications

A meta-heuristic algorithm for integrated optimization of dynamic resource allocation planning and production scheduling in parallel machine system

A meta-heuristic algorithm for integrated optimization of dynamic resource allocation planning and production scheduling in parallel machine system

Production, maintenance and resource scheduling: A review

Hybrid genetic algorithm based on bin packing strategy for the unrelated parallel workgroup scheduling problem

Contact Info

Product

Resources

About