A comparative study of dispatching rules in dynamic flowshops and jobshops
From MaRDI portal
Publication:1610138
DOI10.1016/S0377-2217(98)00023-XzbMath1009.90038OpenAlexW2088865390MaRDI QIDQ1610138
Oliver Holthaus, Chandrasekharan Rajendran
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00023-x
Related Items
A new rule for minimizing the number of tardy jobs in dynamic flow shops ⋮ Development and analysis of cost-based dispatching rules for job shop scheduling ⋮ Scheduling a dynamic flexible flow line with sequence-dependent setup times: a simulation analysis ⋮ A multi-criteria adaptive control scheme based on neural networks and fuzzy inference for DRC manufacturing systems ⋮ Dispatching rule selection with Gaussian processes ⋮ A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem ⋮ Longest path analysis in networks of queues: dynamic scheduling problems ⋮ Simplifying dispatching rules in genetic programming for dynamic job shop scheduling ⋮ Genetic programming-based hyper-heuristic approach for solving dynamic job shop scheduling problem with extended technical precedence constraints ⋮ A DRL based approach for adaptive scheduling of one-of-a-kind production ⋮ Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates ⋮ Automatically evolving preference-based dispatching rules for multi-objective job shop scheduling ⋮ Augmented neural networks for task scheduling. ⋮ A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication ⋮ Using simulation and multi-criteria methods to provide robust solutions to dispatching problems in a flow shop with multiple processors ⋮ A Neural Network Based Decision Support System for Real-Time Scheduling of Flexible Manufacturing Systems ⋮ A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm ⋮ Rule-based scheduling in wafer fabrication with due date-based objectives ⋮ A cooperative dispatching approach for minimizing mean tardiness in a dynamic flowshop ⋮ Influence of capacity- and time-constrained intermediate storage in two-stage food production systems ⋮ A heuristic to schedule flexible job-shop in a glass factory ⋮ A survey of dynamic scheduling in manufacturing systems ⋮ An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns ⋮ Using dispatching rules for job shop scheduling with due date-based objectives ⋮ A study on the performance of scheduling rules in buffer-constrained dynamic flowshops
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of priority rule-based scheduling
- Modified simulated annealing algorithms for the flow shop sequencing problem
- Flowshop sequencing with mean flowtime objective
- Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment
- Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures
- An Evaluation of Flow Shop Sequencing Heuristics
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- Review of sequencing research
