A survey of priority rule-based scheduling
From MaRDI portal
We survey the literature on heuristic priority rule-based job shop scheduling. Priority rules have been intensively investigated over the last 30 years by means of simulation experiments. They are also used in Shop Floor Control software systems. We present a classification, a characterization, and an evaluation of elementary priority rules. Some priority rule-related model extensions are discussed.
Recommendations
- A survey and evaluation of static flowshop scheduling heuristics
- Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule
- A priority list based heuristic for the job shop problem
- scientific article; zbMATH DE number 1293734
- Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
Cites work
- A general search sequencing rule for job shop sequencing
- A Review of Production Scheduling
- A Simulation Study of Operating Policies in a Hypothetical Dual-Constrained Job Shop
- A Simulation Study of Predictable Due-Dates
- A Survey of Scheduling Rules
- An evaluation of value based dispatching rules in a flow shop
- Focused Scheduling in Proportionate Flowshops
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- Note—A Note on “Critical Ratio Scheduling: An Experimental Analysis”
- Note—On Anomalies in Dynamic Ratio Type Scheduling Rules: A Clarifying Analysis
- Optimal due-date assignment in a job shop†
- Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules
- Review of sequencing research
- Search and Simulation Selection of a Job-Shop Sequencing Rule
- Symposium on the theory of scheduling and its applications
- The development and evaluation of a cost-based composite scheduling rule
Cited in
(62)- 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
- Evolution based learning in a job shop scheduling environment
- List scheduling algorithms to minimize the makespan on identical parallel machines
- Dynamic non-preemptive single machine scheduling
- Look ahead job demanding for improving job shop performance
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- 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
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- A parallel machine schedule updating game with compensations and clients averse to uncertain loss
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- Insertion techniques for the heuristic solution of the job shop problem
- Deterministic job-shop scheduling: Past, present and future
- Optimal combinations of priority scheduling rules
- Development and analysis of cost-based dispatching rules for job shop scheduling
- Executing production schedules in the face of uncertainties: a review and some future directions
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
- Job scheduling of diffusion furnaces in semiconductor fabrication facilities
- Machine scheduling in production: a content analysis
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- A memetic algorithm for the job-shop with time-lags
- Petri net based scheduling
- Optimizing makespan and stability risks in job shop scheduling
- 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
- Suppplement to development of priority rule model in production management information system
- Machine scheduling in underground mining: an application in the potash industry
- Dispatching rule selection with Gaussian processes
- 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
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- New expression of scheduling performance measures
- An online approach to dynamic rescheduling for production planning applications
- A general search sequencing rule for job shop sequencing
- scientific article; zbMATH DE number 1293734 (Why is no real title available?)
- Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
- On the integration of theoretical single-objective scheduling results for multi-objective problems
- Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
- A priority list based heuristic for the job shop problem
- A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
- Priority-Rule Methods for Project Scheduling with Work Content Constraints
- Cooperative dispatching -- exploiting the flexibility of an FMS by means of incremental optimization
- 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
- Scheduling wagons to unload in bulk cargo ports with uncertain processing times
- Application of quantum approximate optimization algorithm to job shop scheduling problem
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Graph neural network and expert-guided deep reinforcement learning for solving flexible job-shop scheduling problem
- Flexible job shop scheduling problem using graph neural networks and reinforcement learning
- Lower and upper bounds for scheduling a real-life assembly problem with precedences and resource constraints
- A speed-up procedure and new heuristics for the classical job shop scheduling problem: a computational evaluation
- Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung
- Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach
- Search-based job shop scheduling and sequencing: Extensions to the search sequencing rule
- An improved constraint satisfaction adaptive neural network for job-shop scheduling
This page was built for publication: A survey of priority rule-based scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111923)
