A survey of priority rule-based scheduling

From MaRDI portal
Publication:1111923

DOI10.1007/BF01721162zbMath0658.90047MaRDI QIDQ1111923

S. H. Smith

Publication date: 1989

Published in: OR Spektrum (Search for Journal in Brave)




Related Items

Development and analysis of cost-based dispatching rules for job shop scheduling, Machine scheduling in underground mining: an application in the potash industry, Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis, A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches, On the flexibility of a decision theory-based heuristic for single machine scheduling, Executing production schedules in the face of uncertainties: a review and some future directions, Evolution based learning in a job shop scheduling environment, Dispatching rule selection with Gaussian processes, A parallel machine schedule updating game with compensations and clients averse to uncertain loss, Job scheduling of diffusion furnaces in semiconductor fabrication facilities, List scheduling algorithms to minimize the makespan on identical parallel machines, Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date, Dynamic non-preemptive single machine scheduling, Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics, Look ahead job demanding for improving job shop performance, Optimizing makespan and stability risks in job shop scheduling, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints, An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning, Scheduling wagons to unload in bulk cargo ports with uncertain processing times, Application of quantum approximate optimization algorithm to job shop scheduling problem, A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates, New expression of scheduling performance measures, Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm, An online approach to dynamic rescheduling for production planning applications, An efficient genetic algorithm for job shop scheduling with tardiness objectives., A worker constrained flexible job shop scheduling problem with sequence-dependent setup times, A memetic algorithm for the job-shop with time-lags, On the Integration of Theoretical Single-Objective Scheduling Results for Multi-objective Problems, A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints, Cooperative dispatching -- exploiting the flexibility of an FMS by means of incremental optimization, Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs, A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop, An improved constraint satisfaction adaptive neural network for job-shop scheduling, A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs, An effective hybrid optimization strategy for job-shop scheduling problems, Machine scheduling in production: a content analysis, Insertion techniques for the heuristic solution of the job shop problem, A study on the performance of scheduling rules in buffer-constrained dynamic flowshops, Deterministic job-shop scheduling: Past, present and future, Hybrid rollout approaches for the job shop scheduling problem, The job shop scheduling problem: Conventional and new solution techniques, The complexity of multidimensional periodic scheduling, Petri net based scheduling, A large step random walk for minimizing total weighted tardiness in a job shop, The disjunctive graph machine representation of the job shop scheduling problem, A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung, A comparative study of dispatching rules in dynamic flowshops and jobshops



Cites Work