Uses of Class
jasima.shopSim.core.PR
-
-
Uses of PR in jasima.shopSim.core
Methods in jasima.shopSim.core that return PR Modifier and Type Method Description PRPR. clone()PRShopExperiment. getBatchSequencingRule()protected PRShopExperiment. getBatchSequencingRule(int i)PRWorkStation. getBatchSequencingRule()PR[]ShopExperiment. getBatchSequencingRules()PRPriorityQueue. getSequencingRule()PRShopExperiment. getSequencingRule()protected PRShopExperiment. getSequencingRule(int i)PR[]ShopExperiment. getSequencingRules()PRPR. getTieBreaker()PRPR. primaryRule()If this rule is used as a tie-breaker for another rule, PrimaryRule points to the rule this rule is the tieBreaker for, i.e.PRPR. setFinalTieBreaker(PR tieBreaker)Convenience method to set the last tie breaker rule in a chain.PRPR. setOwner(WorkStation o)Methods in jasima.shopSim.core with parameters of type PR Modifier and Type Method Description voidShopExperiment. setBatchSequencingRule(PR batchSequencingRule)Sets a certain dispatching rule to be used for sequencing batches on all batch machines.voidWorkStation. setBatchSequencingRule(PR batchSequencingRule)voidShopExperiment. setBatchSequencingRules(PR[] batchSequencingRules)Sets a batch sequencing rule for specific machines.PRPR. setFinalTieBreaker(PR tieBreaker)Convenience method to set the last tie breaker rule in a chain.voidPriorityQueue. setSequencingRule(PR sr)voidShopExperiment. setSequencingRule(PR sequencingRule)Sets a certain dispatching rule to be used for sequencing jobs on all machines.voidShopExperiment. setSequencingRules(PR[] sequencingRules)Sets a sequencing rule for specific machines.voidPR. setTieBreaker(PR tieBreaker)Sets the tie breaker rule to use. -
Uses of PR in jasima.shopSim.prioRules.basic
Subclasses of PR in jasima.shopSim.prioRules.basic Modifier and Type Class Description classATCThis class implements the Apparent Tardiness Costs rule by Vepsalainen and Morton (1987).classCRThis class implements the Critical Ratio rule and some of its variants, developed by Rose (2002), doi:10.1109/WSC.2002.1166410.static classCR.Variant1static classCR.Variant2classEDDThis class implements the Earliest Due Date first rule.classFASFSThis class implements the First Arrival at Shop First Served rule.classFCFSThis class implements the First Come First Served rule, also known as FIFO (First In (buffer) First Out).classMDDThis class implements the Modified Due Date rule, developed by Baker and Bertrand (1982) and Baker and Kanet (1983).classMODThis class implements the Modified Operation Due Date rule, developed by Baker and Kanet (1983).classODDThis class implements the Operation Due Date rule.classRNDImplements the random rule, i.e., each waiting job has an equal chance of being selected.classSIThis rule implements a truncated version of SPT, often referred to as SI^x, see e.g.classSLKThis rule implements the Least (global) Slack rule.classSPTThis class implements the Shortest Processing Time rule.classSRPTThis class implements the Shortest Remaining Processing Time rule, which equals SPT for problems with only one work center.classSRPTPerPTThis class implements the Remaining Processing Time per Imminent Processing Time rule.classSRPTPerSLKThis rule implements the "remaining processing time per slack" rule.classTieBreakerFASFSThis class implements a rule that sequences job in increasing order of their job number.Methods in jasima.shopSim.prioRules.basic that return PR Modifier and Type Method Description PRRND. clone()Methods in jasima.shopSim.prioRules.basic with parameters of type PR Modifier and Type Method Description voidSI. setTieBreaker(PR tieBreaker) -
Uses of PR in jasima.shopSim.prioRules.batch
Subclasses of PR in jasima.shopSim.prioRules.batch Modifier and Type Class Description classBATCSThis class implements a version of the Batch ATC with Setups rule by Mason et al. (2002).static classBATCS.Variant1classBFASFSThis class implements a batch version of the FASFS rule.classLBFThis class implements the Largest Batch Family rule, which chooses the job for which most other jobs of the same batch family are waiting in the queue.classMaxBatchSizeThis class implements the Largest Relative Batch rule, which chooses the batch that uses most of the available capacity of the machine. -
Uses of PR in jasima.shopSim.prioRules.gp
Subclasses of PR in jasima.shopSim.prioRules.gp Modifier and Type Class Description classGECCO2010_genSeed_10repsA rule from "Towards Improved Dispatching Rules for Complex Shop Floor Scenarios—a Genetic Programming Approach", Hildebrandt, Heger, Scholz-Reiter, GECCO 2010, doi:10.1145/1830483.1830530classGECCO2010_genSeed_2repsA rule from "Towards Improved Dispatching Rules for Complex Shop Floor Scenarios—a Genetic Programming Approach", Hildebrandt, Heger, Scholz-Reiter, GECCO 2010, doi:10.1145/1830483.1830530classGECCO2010_lookaheadA rule from "Towards Improved Dispatching Rules for Complex Shop Floor Scenarios—a Genetic Programming Approach", Hildebrandt, Heger, Scholz-Reiter, GECCO 2010, doi:10.1145/1830483.1830530classGPRuleBaseAbstract base class that can be used for rules generated with Genetic Programming.classWSC2010_GPRuleSize199A rule from "Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness" , WinterSim 2010, doi:10.1109/WSC.2010.5678946.classWSC2010_GPRuleSize98A rule from "Generating dispatching rules for semiconductor manufacturing to minimize weighted tardiness" , WinterSim 2010, doi:10.1109/WSC.2010.5678946. -
Uses of PR in jasima.shopSim.prioRules.meta
Subclasses of PR in jasima.shopSim.prioRules.meta Modifier and Type Class Description classAdaptiveLAThresholdThis class implements a rule with a max waiting time threshold value specified relative to the minimum time it takes to process any job waiting in the queue. maxWaitRelative has to be in the range [0,1].classFixedLAThresholdThis class implements a rule that assigns a lower priority to any lookahead job arriving later than a given threshold value.classIgnoreFutureJobsHelper class to use a rule which is designed to assign a low priority to future jobs when the lookahead is enabled, thereby generating non delay schedules.classInverseNegates the value of the base rule.classLookaheadThresholdThis class implements a method to distinguish lookahead jobs that arrive later than a given threshold value.classSimplePRUtility class that can be used to write simple priority rules as a lambda expression (PR itself is not a functional interface).Methods in jasima.shopSim.prioRules.meta that return PR Modifier and Type Method Description PRInverse. clone()PRInverse. getBaseRule()PRInverse. setOwner(WorkStation o)Methods in jasima.shopSim.prioRules.meta with parameters of type PR Modifier and Type Method Description voidInverse. setBaseRule(PR base)voidFixedLAThreshold. setTieBreaker(PR tieBreaker)Constructors in jasima.shopSim.prioRules.meta with parameters of type PR Constructor Description AdaptiveLAThreshold(PR baseRule)AdaptiveLAThreshold(PR baseRule, double maxWaitRelative)FixedLAThreshold(PR baseRule)FixedLAThreshold(PR baseRule, double maxWait)IgnoreFutureJobs(PR baseRule)Inverse(PR baseRule) -
Uses of PR in jasima.shopSim.prioRules.setup
Subclasses of PR in jasima.shopSim.prioRules.setup Modifier and Type Class Description classATCSThis class implements the Apparent Tardiness Costs with Setups rule, developed by Lee and Pinedo (1997).classDKThis class implements the DK rule, developed by Mahmoodi and Dooley (1991), see also Pickardt and Branke (2012).classECRThis class implements the Enhanced Critical Ratio rule, developed by Chiang and Fu (2009), see also Pickardt and Branke (2012).classFCRThis class implements the Family Critical Ratio rule, developed by Kim and Bobrowski (1994), which assigns highest priority to all jobs that belong to the family which includes the job with the lowest critical ratio, see also Pickardt and Branke (2012).classFEDDThis class implements the Family Earliest Due Date rule, developed by Mahmoodi et al. (1990), which assigns highest priority to all jobs that belong to the family which includes the job with the earliest due date, see also Pickardt and Branke (2012).classFFCFSThis class implements the Family First Come First Served rule, developed by Flynn (1987), which assigns highest priority to all jobs that belong to the family which includes the job that arrived first to the queue, see also Pickardt and Branke (2012).classMASPThis class implements the Minimum Average Setup plus Processing time rule, developed by Russell and Philipoom (1991), which assigns highest priority to all jobs that belong to the family with the shortest processing time per job, see also Pickardt and Branke (2012).classMMSThis class implements the Minimum Marginal Setup time rule, developed by Arzi and Raviv (1998), which assigns highest priority to all jobs that belong to the family with the shortest setup time per job, see also Pickardt and Branke (2012).classSetupAvoidanceReturns a priority of +1 if setup states of the machine matches the setup state required by a job, or -1 otherwise.classSNSPTThis class implements the Shortest Normalized Setup and Processing Time rule, see Pickardt and Branke (2012).classSSPTThis class implements the Shortest Setup and Processing Time rule, developed by Wilbrecht and Prescott (1969), which selects the job that can be completed the quickest, see also Pickardt and Branke (2012).classSSTThis class implements the Shortest Setup Time rule.classWBPTThis class implements the Weighted Batch Processing Time rule, developed by Raman et al. (1989), which is an additive combination of MMS and SPT, see also Pickardt and Branke (2012). -
Uses of PR in jasima.shopSim.prioRules.upDownStream
Subclasses of PR in jasima.shopSim.prioRules.upDownStream Modifier and Type Class Description classIFTMinusUITThis class implements a rule developed by Branke and Pickardt (2011) for job shop problems, which attempts to measure the usable idle time on other work centers in the prioritization of jobs.classIFTMinusUITPlusNPTThis class implements an extension of the IFTMinusUIT rule, developed by Branke and Pickardt (2011).classPTPlusWINQThis class implements the PT+WINQ rule, developed by Holthaus and Rajendran (1997), which is an additive combination of SPT and WINQ.classPTPlusWINQPlusNPTThis class implements the 2PT+WINQ+NPT rule, developed by Holthaus and Rajendran (2000), DOI: 10.1080/095372800232379, which extends PT+WINQ by taking into account the processing time of a job's next operation.classPTPlusWINQPlusSlackThis class implements the PT+WINQ+SL rule, developed by Rajendran and Holthaus (1999), which extends PT+WINQ by taking into account the slack of a job.classWINQThe class implements the Least Work content In Next Queue rule, see Haupt (1989).classXWINQThe class implements the Extended Least Work content In Next Queue rule, see Haupt (1989). -
Uses of PR in jasima.shopSim.prioRules.weighted
Subclasses of PR in jasima.shopSim.prioRules.weighted Modifier and Type Class Description classLWThis class implements the Largest Weight rule, where different weights express different levels of importance of jobs.classWMDDThis class implements the Weighted Modified Due Date rule, developed by Kanet and Li (2004), which extends MDD by taking different job weights into account.classWMODThis class implements the Weighted Modified Operation Due Date rule, which extends MOD by taking different job weights into account.classWSPTThis class implements the Weighted Shortest Processing Time rule.
-