File Download
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: Solving integrated process planning and scheduling problem with constraint programming
Title | Solving integrated process planning and scheduling problem with constraint programming |
---|---|
Authors | |
Keywords | Constraint programming Process planning Job-shop scheduling IPPS |
Issue Date | 2012 |
Publisher | APIEMS. |
Citation | The 13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS 2012) and 15th Asia Pacific Regional Meeting of the International Foundation for Production Research, Phuket, Thailand, 2-5 December 2012. In APIEMS 2012 Conference Proceedings, 2012, p. 1525-1532 How to Cite? |
Abstract | Process planning and scheduling are two important manufacturing functions which are usually performed sequentially. However, due to the uncertainties and disturbances frequently occurring in the manufacturing environment, the separately conducted process plan and shopfloor schedule may lose their optimality, becoming ineffective or even infeasible. Researchers have considered the potential of integrated process planning and scheduling (IPPS) to conduct the two manufacturing planning activities concurrently instead of sequentially. That is, to integrate process planning with dynamic shopfloor scheduling to cope with the realtimeshopfloor status. The IPPS problem is very complex and it has been regarded as an NP-hard problem. Many researchers have attempted to solve the IPPS problem with intelligent approaches such as meta-heuristics and agent-based negotiation. In this paper, a constraint programming-based approach is proposed and implemented in the IPPS problem domain. Constraint programming (CP) features great modeling capabilities to reflect complex constraints of a problem, and there is a great potential for CP to be used to solve IPPS problems. The approach is implemented and tested on the IBM ILOG platform, and experimental results show that the CP can handle the IPPS problem efficiently and effectively. |
Description | Session - Scheduling and Sequencing 3: paper no. T3D3 The APIEMS 2012 Conference proceedings' website is located at http://apiems.net/conf2012/ |
Persistent Identifier | http://hdl.handle.net/10722/189927 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, L | en_US |
dc.contributor.author | Wong, TN | en_US |
dc.date.accessioned | 2013-09-17T15:03:07Z | - |
dc.date.available | 2013-09-17T15:03:07Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | The 13th Asia Pacific Industrial Engineering and Management Systems Conference (APIEMS 2012) and 15th Asia Pacific Regional Meeting of the International Foundation for Production Research, Phuket, Thailand, 2-5 December 2012. In APIEMS 2012 Conference Proceedings, 2012, p. 1525-1532 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/189927 | - |
dc.description | Session - Scheduling and Sequencing 3: paper no. T3D3 | - |
dc.description | The APIEMS 2012 Conference proceedings' website is located at http://apiems.net/conf2012/ | - |
dc.description.abstract | Process planning and scheduling are two important manufacturing functions which are usually performed sequentially. However, due to the uncertainties and disturbances frequently occurring in the manufacturing environment, the separately conducted process plan and shopfloor schedule may lose their optimality, becoming ineffective or even infeasible. Researchers have considered the potential of integrated process planning and scheduling (IPPS) to conduct the two manufacturing planning activities concurrently instead of sequentially. That is, to integrate process planning with dynamic shopfloor scheduling to cope with the realtimeshopfloor status. The IPPS problem is very complex and it has been regarded as an NP-hard problem. Many researchers have attempted to solve the IPPS problem with intelligent approaches such as meta-heuristics and agent-based negotiation. In this paper, a constraint programming-based approach is proposed and implemented in the IPPS problem domain. Constraint programming (CP) features great modeling capabilities to reflect complex constraints of a problem, and there is a great potential for CP to be used to solve IPPS problems. The approach is implemented and tested on the IBM ILOG platform, and experimental results show that the CP can handle the IPPS problem efficiently and effectively. | - |
dc.language | eng | en_US |
dc.publisher | APIEMS. | - |
dc.relation.ispartof | Proceedings of the Asia Pacific Industrial Engineering & Management Systems Conference 2012 | en_US |
dc.subject | Constraint programming | - |
dc.subject | Process planning | - |
dc.subject | Job-shop scheduling | - |
dc.subject | IPPS | - |
dc.title | Solving integrated process planning and scheduling problem with constraint programming | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Wong, TN: tnwong@hku.hk | en_US |
dc.identifier.authority | Wong, TN=rp00192 | en_US |
dc.description.nature | published_or_final_version | - |
dc.identifier.hkuros | 221537 | en_US |
dc.identifier.spage | 1525 | en_US |
dc.identifier.epage | 1532 | en_US |