Computer-assisted multi-item, muti-machine and multi-site scheduling in a hardwood flooring factory
Computers in Industry - Special issue on computer integrated manufacturing in the process industries (I-CIMPRO)
ACM Transactions on Computational Logic (TOCL)
Computers and Industrial Engineering
Advanced planning and scheduling with outsourcing in manufacturing supply chain
Computers and Industrial Engineering - Supply chain management
Visopt ShopFloor: On the Edge of Planning and Scheduling
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling
Computers and Operations Research
Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces", 27)
A simulated annealing-based optimization approach for integrated process planning and scheduling
International Journal of Computer Integrated Manufacturing
Depth-bounded discrepancy search
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Evolutionary algorithm for advanced process planning and scheduling in a multi-plant
Computers and Industrial Engineering
Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.01 |
Many research initiatives carried out in production management consider process planning and operations scheduling as two separate and sequential functions. However, in certain contexts, the two functions must be better integrated. This is the case in divergent production systems with co-production (i.e. production of different products at the same time from a single product input) when alternative production processes are available. This paper studies such a context and focuses on the case of drying and finishing operations in a softwood lumber facility. The situation is addressed using a single model that simultaneously performs process planning and scheduling. We evaluate two alternative formulations. The first one is based on mixed integer programming (MIP) and the second on constraint programming (CP). We also propose a search procedure to improve the performance of the CP approach. Both approaches are compared with respect to their capacity to generate good solutions in short computation time.