MétaCan
Menu
Back to cohort
Record W2603240292 · doi:10.1109/ram.2017.7889710

Joint optimization of maintenance and production scheduling

2017· article· en· W2603240292 on OpenAlexaff
Amirkiarash Kiani, Sharareh Taghipour

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicReliability and Maintenance Optimization
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsTardinessPreventive maintenanceScheduling (production processes)Computer scienceReliability engineeringShutdownJob shop schedulingReal-time computingEngineeringOperations managementSchedule

Abstract

fetched live from OpenAlex

Maintenance and production scheduling are interconnected activities which should be planned jointly to minimize their total cost as well as jobs tardiness. Although, the joint optimization of maintenance planning and production scheduling has been addressed extensively in literature, no study has considered production and maintenance optimization based on the concept of delay-time model (DTM). DTM has been effectively utilized in industry for inspection optimization of various systems, such as oil-hydraulic extrusion press, production plant, and industrial vehicles. The DTM considers a two-stage failure process for a system, in which an initial defect will eventually lead to a failure, if left unattended. The elapsed time between a defect occurrence and the failure (in the absence of inspection) is called delay-time, which provides a window of opportunity to inspect the system and fix the defect. In this paper, we consider a single system in a manufacturing plant which is required to process n independent jobs, while a job cannot be preempted for another job. We assume that the system has a single dominant failure mode, and model the system's failure using the DTM concept, in which the time to a defect appearance and the delay time follow certain distributions. The delay time distribution is independent of the time to defect. The system can be completely renewed by preventive replacement before a job to reduce the probability of a defect arrival and its subsequent failure while the job is being processed. An unattended defect may lead to a failure, which causes the system shutdown. The system is then replaced after a failure, and the job is restarted. We assume that the time required for a preventive replacement of the system is shorter than the time required for corrective replacement after a failure. We will jointly optimize preventive maintenance and production scheduling which results in the minimum total expected cost consisting of tardiness penalty and preventive and corrective maintenance costs. More specifically, we will determine the optimal sequence of the jobs as well as the decision on whether or not preventive replacement should be performed before a specific job. We will formulate the objective function and derive analytic expressions to obtain the total expected cost for a given sequence of jobs and a preventive replacement scheme. The application of the proposed model is shown in a case study. The results of the study indicate the optimal job sequence obtained from the joint optimization problem could differ from the case where the optimal sequence is obtained in a standalone scheduling problem. Moreover, the optimal solution depends on the input parameters of the model, most specifically, the job processing times and the distributions of defect arrival and delay time.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.005
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.013
GPT teacher head0.207
Teacher spread0.194 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicReliability and Maintenance OptimizationFrench-language works237,207