Integrating preventive maintenance planning and production scheduling under reentrant job shop (Q1993028): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2017/6758147 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2596428935 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59147712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Re-entrant lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bi-objective ant colony optimization approach to optimize production and maintenance scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning Machine Maintenance in Two-Machine Shop Scheduling / rank
 
Normal rank

Latest revision as of 05:36, 17 July 2024

scientific article
Language Label Description Also known as
English
Integrating preventive maintenance planning and production scheduling under reentrant job shop
scientific article

    Statements

    Integrating preventive maintenance planning and production scheduling under reentrant job shop (English)
    0 references
    0 references
    0 references
    5 November 2018
    0 references
    Summary: This paper focuses on a preventive maintenance plan and production scheduling problem under reentrant Job Shop in semiconductor production. Previous researches discussed production scheduling and preventive maintenance plan independently, especially on reentrant Job Shop. Due to reentrancy, reentrant Job Shop scheduling is more complex than the standard Job Shop which belongs to NP-hard problems. Reentrancy is a typical characteristic of semiconductor production. What is more, the equipment of semiconductor production is very expensive. Equipment failure will affect the normal production plan. It is necessary to maintain it regularly. So, we establish an integrated and optimal mathematical model. In this paper, we use the hybrid particle swarm optimization algorithm to solve the problem for it is highly nonlinear and discrete. The proposed model is evaluated through some simple simulation experiments and the results show that the model works better than the independent decision-making model in terms of minimizing maximum completion time.
    0 references

    Identifiers