Project-driven planning and scheduling support for virtual manufacturing |
| |
Authors: | Zbigniew A. Banaszak Marek B. Zaremba |
| |
Affiliation: | (1) Department of Computer Science and Management, Technical University of Koszalin, Śniadeckich 2, 75-453 Koszalin, Poland;(2) Département d’informatique et d’ingénierie, Université du Québec (UQO), Gatineau, QC, J8X 3X7, Canada |
| |
Abstract: | ![]() The paper addresses the issue of decision-making support for small and medium-size enterprises operating within a virtual project-driven enterprise environment. The problem considered here can be defined in terms of finding a feasible schedule that satisfies the constraints imposed by the work-order duration, the price, and the time-constrained resource availability. The problem belongs to the class of multi-mode case problems of project scheduling, where finding a feasible solution is NP-hard. A heuristic method for process planning and scheduling is proposed. The method is based on a critical path approach and the branch and bound search scheme. It has been implemented in a web-enabled interactive software package, and is illustrated using the example of a virtual construction enterprise. Received: February 2005 / Accepted: January 2006 |
| |
Keywords: | Project management Virtual enterprise Scheduling Production planning SME Project-driven manufacturing Branch and bound search |
本文献已被 SpringerLink 等数据库收录! |
|