Minimizing makespan of stochastic customer orders in cellular manufacturing systems with parallel machines
From MaRDI portal
Publication:2664451
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
- A dynamic scheduling approach for optimizing the material handling operations in a robotic cell
- Makespan-related criteria for comparing schedules in stochastic environments
- On solving manufacturing cell formation via bicluster editing
- Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment
- Prioritized customer order scheduling to maximize throughput
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
Cited in
(3)- An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems
- Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
- Joint scheduling of production and condition-based maintenance activities for make-to-order deteriorating manufacturing systems under repairmen constraint
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)