Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines
From MaRDI portal
Publication:2664451
DOI10.1016/J.COR.2020.105101zbMATH Open1458.90389OpenAlexW3084260397MaRDI QIDQ2664451FDOQ2664451
Authors: Lang Wu, Yaping Zhao, Yuanyue Feng, Ben Niu, Xiaoyun Xu
Publication date: 20 April 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105101
Recommendations
- The customer order lead-time problem on parallel machines
- The complexity of customer order scheduling problems on parallel machines
- Scheduling parallel machines for the customer order problem
- Design of a facility layout problem in cellular manufacturing systems with stochastic demands
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem
Cites Work
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
- On solving manufacturing cell formation via bicluster editing
- Prioritized customer order scheduling to maximize throughput
- Makespan-related criteria for comparing schedules in stochastic environments
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
- Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
Cited In (2)
This page was built for publication: Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664451)