Scheduling custom printed napkin manufacturing by P-graphs.
Márton FritsBotond BertókPublished in: Comput. Chem. Eng. (2020)
Keyphrases
- manufacturing environment
- production planning
- wafer fabrication
- scheduling problem
- series parallel
- domain specific
- manufacturing systems
- material handling
- shop floor
- graph theoretic
- scheduling algorithm
- quality control
- resource constraints
- graph theory
- graph matching
- resource allocation
- graph representation
- semiconductor manufacturing
- dynamic scheduling
- round robin
- graph mining
- bipartite graph
- directed graph
- general purpose
- graph clustering
- parallel machines
- manufacturing process
- random graphs
- product design
- graph data
- digital libraries
- complex structures
- weighted graph
- lower bound