File Download
Supplementary

Conference Paper: Solving integrated process planning and scheduling problem with constraint programming

TitleSolving integrated process planning and scheduling problem with constraint programming
Authors
KeywordsConstraint programming
Process planning
Job-shop scheduling
IPPS
Issue Date2012
PublisherAPIEMS.
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?
AbstractProcess 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.
DescriptionSession - Scheduling and Sequencing 3: paper no. T3D3
The APIEMS 2012 Conference proceedings' website is located at http://apiems.net/conf2012/
Persistent Identifierhttp://hdl.handle.net/10722/189927

 

DC FieldValueLanguage
dc.contributor.authorZhang, Len_US
dc.contributor.authorWong, TNen_US
dc.date.accessioned2013-09-17T15:03:07Z-
dc.date.available2013-09-17T15:03:07Z-
dc.date.issued2012en_US
dc.identifier.citationThe 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-1532en_US
dc.identifier.urihttp://hdl.handle.net/10722/189927-
dc.descriptionSession - Scheduling and Sequencing 3: paper no. T3D3-
dc.descriptionThe APIEMS 2012 Conference proceedings' website is located at http://apiems.net/conf2012/-
dc.description.abstractProcess 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.languageengen_US
dc.publisherAPIEMS.-
dc.relation.ispartofProceedings of the Asia Pacific Industrial Engineering & Management Systems Conference 2012en_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectConstraint programming-
dc.subjectProcess planning-
dc.subjectJob-shop scheduling-
dc.subjectIPPS-
dc.titleSolving integrated process planning and scheduling problem with constraint programmingen_US
dc.typeConference_Paperen_US
dc.identifier.emailWong, TN: tnwong@hku.hken_US
dc.identifier.authorityWong, TN=rp00192en_US
dc.description.naturepublished_or_final_version-
dc.identifier.hkuros221537en_US
dc.identifier.spage1525en_US
dc.identifier.epage1532en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats