Integrated process planning and scheduling in a supply chain

Authors:
Chiung Moon;Young Hae Lee;Chan Seok Jeong;YoungSu Yun
Affiliations:
Department of Information and Industrial Engineering, Yonsei University, Seoul, Republic of Korea;Department of Information and Industrial Engineering, Hanyang University, Ansan, Gyeonggi-do, Republic of Korea;Korea Army, Seoul, Republic of Korea;Department of Business Administration, Chosun University, Gwangju, Republic of Korea
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 5
Cited 5

Fundamentals of data structures in PASCAL

Fundamentals of data structures in PASCAL
Process planning and scheduling—a method of integration for productivity improvement

Computers and Industrial Engineering
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain

Computers and Industrial Engineering - Supply chain management
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines

Computers and Operations Research

Integration of process planning and scheduling-A modified genetic algorithm-based approach

Computers and Operations Research
Review article: A review of soft computing applications in supply chain management

Applied Soft Computing
A novel genetic algorithm for solving production and transportation scheduling in a two-stage supply chain

Computers and Industrial Engineering
A multi-agent system using iterative bidding mechanism to enhance manufacturing agility

Expert Systems with Applications: An International Journal
Dynamic supply chain scheduling

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper deals with the integration of process planning and scheduling, which is one of the most important functions in a supply chain to achieve high quality products at lower cost, lower inventory, and high level of performance. Solving the problem is essential for the generation of flexible process sequences with resource selection and for the decision of the operation schedules that can minimize makespan. We formulate a mixed integer programming model to solve this problem of integration. This model considers alternative resources: sequences and precedence constraints. To solve the model, we develop a new evolutionary search approach based on a topological sort. We use the topological sort to generate a set of feasible sequences in the model within a reasonable computing time. Since precedence constraints between operations are handled by the topological sort, the developed evolutionary search approach produces only feasible solutions. The experimental results using various sizes of problems provide a way to demonstrate the efficiency of the developed evolutionary search approach.