An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production
DOI10.1016/J.COR.2010.05.002zbMATH Open1231.90207OpenAlexW1974441528MaRDI QIDQ709140FDOQ709140
Authors: Wei Li, Barrie R. Nault, Deyi Xue, Yiliu Tu
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.05.002
Recommendations
- A DRL based approach for adaptive scheduling of one-of-a-kind production
- A new and practical heuristic for Master Production Scheduling creation
- A new heuristic and an exact approach for a production planning problem
- A Heuristic Scheduling Policy for Multi-Item, Single-Machine Production Systems with Time-Varying, Stochastic Demands
- A heuristic algorithm for a production planning problem in an assembly system
- Hybrid Heuristic Approaches for Scheduling in Reconfigurable Manufacturing Systems
- A general heuristic for production planning problems
- A Heuristic Scheduling Policy for Multi-Item, Multi-Machine Production Systems with Time-Varying, Stochastic Demands
- Hybrid heuristic for the production replanning problem under varying demands in manufacturing industries
- A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Feedback control (93B52)
Cites Work
- Resource-constrained project scheduling: A survey of recent developments.
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Title not available (Why is that?)
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- A comprehensive review and evaluation of permutation flowshop heuristics
- Benchmarks for basic scheduling problems
- Flowshop scheduling research after five decades
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A new method for the placement of buffers in serial production lines
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
- Mass customization. Challenges and solutions
- Prediction of manufacturing resource requirements from customer demands in mass-customisation production
Cited In (2)
This page was built for publication: An efficient heuristic for adaptive production scheduling and control in one-of-a-kind production
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709140)