THE MACHINIST'S SEQUENCING DILEMMA

摘要

We examine a single machine sequencing problem of n-jobs which are applied to a single product. While each job adds value to the product, the accumulated product value is always at risk due to a given chance that the next job will fail. Once a job fails the product is considered defective and cannot be repaired. The goal is to find the sequence of jobs which minimizes the expected value of failure. This sequencing problem, which we call the "machinist's sequencing dilemma ", depends on the value of each job and the likelihood that the job will fail. We offer three solutions to this problem: a decision tree approach, a 0-1 mathematical programming, and a genetic algorithm. [PUBLICATION ABSTRACT]