New dispatching rules for shop scheduling: A step forward
From MaRDI portal
Publication:4496932
Recommendations
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- Dispatching rules for scheduling in assembly jobshops - Part 2
- Dispatching rules for scheduling in assembly jobshops - Part 1
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
Cited in
(28)- A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
- Composite Dispatching Rule Generation through Data Mining in a Simulated Job Shop
- Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs
- Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times
- Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints
- Extended GRASP for the job shop scheduling problem with total weighted tardiness objective
- Development and analysis of cost-based dispatching rules for job shop scheduling
- A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop
- A scatter search approach with dispatching rules for a joint decision of cell formation and parts scheduling in batches
- Dynamic routing strategies for JIT production in hybrid flow shops
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs
- Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates
- Heuristic dispatching rule to maximize TDD and IDD performance
- Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace
- A new rule for minimizing the number of tardy jobs in dynamic flow shops
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
- A simulation-optimization framework for generating dynamic dispatching rules for stochastic job shop with earliness and tardiness penalties
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- A comparative study of dispatching rules in dynamic flowshops and jobshops
- Using dispatching rules for job shop scheduling with due date-based objectives
- Effect of load, processing time and due date variation on the effectiveness of scheduling rules
- Dispatching rules for scheduling in assembly jobshops - Part 1
- A dispatching rule extraction method for job shop scheduling problem
- An evaluation of value based dispatching rules in a flow shop
- Rule-based scheduling in wafer fabrication with due date-based objectives
- Dispatching rules for scheduling in assembly jobshops - Part 2
This page was built for publication: New dispatching rules for shop scheduling: A step forward
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4496932)
