Proses planlama ve ağırlıklı teslim tarihi atama ile birlikte ağırlıklı çizelgeleme probleminin bazı saf ve melez meta-sezgisel yöntemler ile çözümü
Entegre süreç planlama ve çizelgeleme probleminin ve entegre teslim tarihi atama ile birlikte çizelgeleme probleminin literatürüne baktığımızda, literatürde bu konularda yüzlerce araştırma bulabiliriz. Fakat, üç önemli üretim fonksiyonlarının entegrasyonu konusu literatürde ele alınmayan bir alandır. Bu çalışmada süreç planlama, ağırlıklı çizelgeleme ve ağırlıklı teslim tarihi atama fonksiyonları entegre edilmiş ve problem bazı saf ve melez meta-sezgisel yöntemler kullanılarak çözülmüştür. Bu çalışmada biz 8 farklı atölyeyi rassal, evrimsel stratejiler, genetic algoritmalar ve bazı melez aramaları kullanarak çalıştık. Biz arama yöntemlerinin çözümü iterasyonlar devam ederken nasıl iyileştirdiğini ve evrimsel stratejiler, genetic algoritmalar ve melez aramaların rassal aramalara göre daha üstün sonuçlar verdiğini gözlemledik. Ayrıca melez aramaların genetic arama ve evrimsel stratejiler gibi güçlü arama teknikleri olduğunu gözlemledik.
Solving process planning and weighted scheduling with WNOPPT weighted due-date assignment problem using some pure and hybrid meta-heuristics
If we search literature for integrated process planning and scheduling problem and for scheduling with due dateassignment problem we can find hundreds of researches made on these problems. But integration of the three importantmanufacturing functions are not addressed much in the literature. In this study process planning, weighted schedulingand weighted due date assignment functions are integrated and solved using some pure and hybrid metaheuristics. Westudied eight shop floors using random, evolutionary strategies, genetic algorithms and some hybrid searches. We triedto observe how search techniques improve solutions as iterations go on and how evolutionary strategies, geneticalgorithms and hybrid search performs well compared to the random search. We also observed that hybrid searchesare also powerful search techniques as genetic search and evolutionary strategies.
___
- W. Tan and B. Khoshnevis, “Integration of
process planning and scheduling— a review,”
Journal of Intelligent Manufacturing, vol. 11, no.
1, pp. 51–63, Feb. 2000.
- X. Li, L. Gao, C. Zhang, and X. Shao, “A review
on Integrated Process Planning and Scheduling,”
International Journal of Manufacturing Research,
vol. 5, no. 2, pp. 161–180, Jan. 2010.
- R. K. Phanden, A. Jain, and R. Verma, “Integration
of process planning and scheduling: a state-of-theart
review,” International Journal of Computer
Integrated Manufacturing, vol. 24, no. 6, pp. 517–
534, Jun. 2011.
- J. M. Usher, “Evaluating the impact of alternative
plans on manufacturing performance,” Computers
& Industrial Engineering, vol. 45, no. 4, pp. 585–
596, Dec. 2003.
- D. Corti and A. Portioli-Staudacher, “A concurrent
engineering approach to selective implementation
of alternative processes,” Robotics and ComputerIntegrated
Manufacturing, vol. 20, no. 4, pp. 265–
280, Aug. 2004.
- J. M. Usher and K. J. Fernandes, “Dynamic
process planning—the static phase,” Journal of
Materials Processing Technology, vol. 61, no. 1,
pp. 53–58, 1996.
- K. A. Aldakhilallah and R. Ramesh, “Computerintegrated
process planning and scheduling
(CIPPS): intelligent support for product design,
process planning and control,” International
journal of production research, vol. 37, no. 3, pp.
481–500, 1999.
- M. Kumar and S. Rajotia, “Integration of
scheduling with computer aided process
planning,” Journal of Materials Processing
Technology, vol. 138, no. 1–3, pp. 297–300, Jul.
2003.
- N. Morad and A. M. S. Zalzala, “Genetic
algorithms in integrated process planning and
scheduling,” Journal of Intelligent Manufacturing,
vol. 10, no. 2, pp. 169–179, 1999.
- C. Zhao and Z. Wu, “A Genetic Algorithm
Approach to the Scheduling of FMSs with
Multiple Routes,” International Journal of
Flexible Manufacturing Systems, vol. 13, no. 1, pp.
71–88, Feb. 2001.
- C. Moon, J. Kim, and S. Hur, “Integrated process
planning and scheduling with minimizing total
tardiness in multi-plants supply chain,” Computers & Industrial Engineering, vol. 43, no. 1, pp. 331–
349, 2002.
- Y. K. Kim, K. Park, and J. Ko, “A symbiotic
evolutionary algorithm for the integration of
process planning and job shop scheduling,”
Computers & Operations Research, vol. 30, no. 8,
pp. 1151–1171, 2003.
-
- X. Shao, X. Li, L. Gao, and C. Zhang, “Integration
of process planning and scheduling—a modified
genetic algorithm-based approach,” Computers &
Operations Research, vol. 36, no. 6, pp. 2082–
2096, 2009.
- X. Li, C. Zhang, L. Gao, W. Li, and X. Shao, “An
agent-based approach for integrated process
planning and scheduling,” Expert Systems with
Applications, vol. 37, no. 2, pp. 1256–1264, Mar.
2010.
- X. Li, L. Gao, and X. Shao, “An active learning
genetic algorithm for integrated process planning
and scheduling,” Expert Systems with
Applications, vol. 39, no. 8, pp. 6683–6691, Jun.
2012.
- A. Seker, S. Erol, and R. Botsali, “A neuro-fuzzy
model for a new hybrid integrated Process
Planning and Scheduling system,” Expert Systems
with Applications, vol. 40, no. 13, pp. 5341–5351,
Oct. 2013.
- L. Zhang and T. N. Wong, “An object-coding
genetic algorithm for integrated process planning
and scheduling,” European Journal of Operational
Research, vol. 244, no. 2, pp. 434–444, 2015.
- W. E. Wilhelm and H.-M. Shin, “Effectiveness of
alternate operations in a flexible manufacturing
system,” International Journal of Production
Research, vol. 23, no. 1, pp. 65–79, Jan. 1985.
- R. M. Sundaram and S. Fu, “Process planning and
scheduling—a method of integration for
productivity improvement,” Computers &
Industrial Engineering, vol. 15, no. 1, pp. 296–
301, 1988.
- N. Nasr and E. A. Elsayed, “Job shop scheduling
with alternative machines,” International Journal
of Production Research, vol. 28, no. 9, pp. 1595–
1609, Sep. 1990.
- B. Khoshnevis and Q. M. Chen, “Integration of
process planning and scheduling functions,” J
Intell Manuf, vol. 2, no. 3, pp. 165–175, Jun. 1991.
- J. Hutchison, K. Leong, D. Synder, and P. Ward,
“Scheduling approaches for random job shop
flexible manufacturing systems,” International
Journal of Production Research, vol. 29, no. 5, pp.
1053–1067, May 1991.
- Q. Chen and B. Khoshnevis, “Scheduling with
flexible process plans,” Production Planning &
Control, vol. 4, no. 4, pp. 333–343, Jan. 1993.
- H.-C. ZHANG and S. MALLUR, “An integrated
model of process planning and production
scheduling,” International Journal of Computer
Integrated Manufacturing, vol. 7, no. 6, pp. 356–
364, Nov. 1994.
- J. Kempenaers, J. Pinte, J. Detand, and J.-P. Kruth,
“A collaborative process planning and scheduling
system,” Advances in Engineering Software, vol.
25, no. 1, pp. 3–8, 1996.
- K.-H. Kim and P. J. Egbelu, “Scheduling in a
production environment with multiple process
plans per job,” International Journal of
Production Research, vol. 37, no. 12, pp. 2725–
2753, Aug. 1999.
- A. Weintraub, D. Cormier, T. Hodgson, R. King,
J. WIlson, and A. Zozom, “Scheduling with
alternatives: a link between process planning and
scheduling,” IIE Transactions, vol. 31, no. 11, pp.
1093–1102, Nov. 1999.
- N. N. Gindy, S. M. Saad, and Y. Yue,
“Manufacturing responsiveness through integrated
process planning and scheduling,” International
Journal of Production Research, vol. 37, no. 11,
pp. 2399–2418, 1999.
- H. Lee and S.-S. Kim, “Integration of process
planning and scheduling using simulation based
genetic algorithms,” The International Journal of
Advanced Manufacturing Technology, vol. 18, no.
8, pp. 586–590, 2001.
- C. Saygin, F. F. Chen, and J. Singh, “Real-time
manipulation of alternative routeings in flexible
manufacturing systems: a simulation study,” The
International Journal of Advanced Manufacturing
Technology, vol. 18, no. 10, pp. 755–763, 2001.
- M. Kumar and S. Rajotia, “Integration of process
planning and scheduling in a job shop
environment,” The International Journal of
Advanced Manufacturing Technology, vol. 28, no.
1–2, pp. 109–116, 2006.
- J. Zhang, L. Gao, F. T. S. Chan, and P. Li, “A
holonic architecture of the concurrent integrated
process planning system,” Journal of Materials
Processing Technology, vol. 139, no. 1–3, pp.
267–272, Aug. 2003.
- I. Drstvenšek and J. Balič, “Responding ability in
dynamic production circumstances,” Journal of
materials processing technology, vol. 133, no. 1,
pp. 71–78, 2003.
- C. Özgüven, L. Özbakır, and Y. Yavuz,
“Mathematical models for job-shop scheduling
problems with routing and process plan
flexibility,” Applied Mathematical Modelling, vol.
34, no. 6, pp. 1539–1548, Jun. 2010.
- R. K. Phanden, A. Jain, and R. Verma, “Integration
of process planning and scheduling: a state-of-theart
review,” International Journal of Computer
Integrated Manufacturing, vol. 24, no. 6, pp. 517–
534, 2011.
- Y. Yin, S.-R. Cheng, T. C. E. Cheng, C.-C. Wu,
and W.-H. Wu, “Two-agent single-machine
scheduling with assignable due dates,” Applied
Mathematics and Computation, vol. 219, no. 4, pp.
1674–1685, Nov. 2012.
- J. Wang, X. Fan, C. Zhang, and S. Wan, “A Graphbased
Ant Colony Optimization Approach for
Integrated Process Planning and Scheduling,”
Chinese Journal of Chemical Engineering, vol. 22,
no. 7, pp. 748–753, Jul. 2014.
- H. I. Demir, O. Uygun, I. Cil, M. Ipek, and M. Sari,
“Process Planning and Scheduling with SLK DueDate
Assignment where Earliness, Tardiness and
Due-Dates are Punished,” JIII, vol. 3, no. 3, pp.
173–180, Sep. 2015.
- V. Gordon, J.-M. Proth, and C. Chu, “A survey of
the state-of-the-art of common due date
assignment and scheduling research,” European
Journal of Operational Research, vol. 139, no. 1,
pp. 1–25, May 2002.
- D. Biskup and H. Jahnke, “Common due date
assignment for scheduling on a single machine
with jointly reducible processing times,”
International Journal of Production Economics,
vol. 69, no. 3, pp. 317–322, Feb. 2001.
- T. C. E. Cheng, S.-J. Yang, and D.-L. Yang,
“Common due-window assignment and
scheduling of linear time-dependent deteriorating
jobs and a deteriorating maintenance activity,”
International Journal of Production Economics,
vol. 135, no. 1, pp. 154–161, Jan. 2012.
- V. Gordon, J.-M. Proth, and C. Chu, “A survey of
the state-of-the-art of common due date
assignment and scheduling research,” European
Journal of Operational Research, vol. 139, no. 1,
pp. 1–25, 2002.
- V. Lauff and F. Werner, “Scheduling with
common due date, earliness and tardiness penalties
for multimachine problems: A survey,”
Mathematical and Computer Modelling, vol. 40,
no. 5–6, pp. 637–655, Sep. 2004.
- L. Min and W. Cheng, “Genetic algorithms for the
optimal common due date assignment and the
optimal scheduling policy in parallel machine
earliness/tardiness scheduling problems,” Robotics
and Computer-Integrated Manufacturing, vol. 22,
no. 4, pp. 279–287, Aug. 2006.
- V. S. Gordon and V. A. Strusevich, “Single
machine scheduling and due date assignment with
positionally dependent processing times,”
European Journal of Operational Research, vol.
198, no. 1, pp. 57–62, 2009.
- H. Allaoua and I. Osmane, “Variable Parameters
Lengths Genetic Algorithm for Minimizing
Earliness-Tardiness Penalties of Single Machine
Scheduling With a Common Due Date,”
Electronic Notes in Discrete Mathematics, vol. 36,
pp. 471–478, Aug. 2010.
- N. H. Tuong and A. Soukhal, “Due dates
assignment and JIT scheduling with equal-size
jobs,” European Journal of Operational Research,
vol. 205, no. 2, pp. 280–289, Sep. 2010.
- V. Gordon and W. Kubiak, “Single machine
scheduling with release and due date assignment to
minimize the weighted number of late jobs,”
Information Processing Letters, vol. 68, no. 3, pp.
153–159, Nov. 1998.
- T. C. E. Cheng and M. Y. Kovalyov, “Complexity
of parallel machine scheduling with processingplus-wait
due dates to minimize maximum
absolute lateness,” European Journal of
Operational Research, vol. 114, no. 2, pp. 403–
410, Apr. 1999.
- J. N. Gupta, K. Krüger, V. Lauff, F. Werner, and
Y. N. Sotskov, “Heuristics for hybrid flow shops
with controllable processing times and assignable
due dates,” Computers & Operations Research,
vol. 29, no. 10, pp. 1417–1439, 2002.
- A. Baykasoğlu and L. Özbakır, “A grammatical
optimization approach for integrated process
planning and scheduling,” Journal of Intelligent
Manufacturing, vol. 20, no. 2, pp. 211–221, 2009.
- Y. Xia, B. Chen, and J. Yue, “Job sequencing and
due date assignment in a single machine shop with
uncertain processing times,” European Journal of
Operational Research, vol. 184, no. 1, pp. 63–75,
2008.
- V. Vinod and R. Sridharan, “Simulation modeling
and analysis of due-date assignment methods and
scheduling decision rules in a dynamic job shop
production system,” International Journal of
Production Economics, vol. 129, no. 1, pp. 127–
146, Jan. 2011.
- M. Y. Kovalyov, “Batch scheduling and common
due date assignment problem: an NP-hard case,”
Discrete applied mathematics, vol. 80, no. 2, pp.
251–254, 1997.
- T. C. E. Cheng, Z.-L. Chen, and N. V.
Shakhlevich, “Common due date assignment and
scheduling with ready times,” Computers &
Operations Research, vol. 29, no. 14, pp. 1957–
1967, Dec. 2002.
- X. Qi, G. Yu, and J. F. Bard, “Single machine
scheduling with assignable due dates,” Discrete
Applied Mathematics, vol. 122, no. 1, pp. 211–233,
2002.
- S. Li, C. T. Ng, and J. Yuan, “Scheduling
deteriorating jobs with CON/SLK due date
assignment on a single machine,” International
Journal of Production Economics, vol. 131, no. 2,
pp. 747–751, Jun. 2011.
- G. Mosheiov, “A common due-date assignment
problem on parallel identical machines,”
Computers & Operations Research, vol. 28, no. 8,
pp. 719–732, Jul. 2001.
- G. I. Adamopoulos and C. P. Pappis, “Scheduling
under a common due-data on parallel unrelated
machines,” European Journal of Operational
Research, vol. 105, no. 3, pp. 494–501, Mar. 1998.
- G. Mosheiov and U. Yovel, “Minimizing weighted
earliness–tardiness and due-date cost with unit
processing-time jobs,” European Journal of
Operational Research, vol. 172, no. 2, pp. 528–
544, 2006.
- H. Luss and M. B. Rosenwein, “A due date
assignment algorithm for multiproduct
manufacturing facilities,” European Journal of
Operational Research, vol. 65, no. 2, pp. 187–198,
1993.
- S. R. Lawrence, “Negotiating due-dates between
customers and producers,” International Journal
of Production Economics, vol. 37, no. 1, pp. 127–
138, 1994.
- T. Yang, Z. He, and K. K. Cho, “An effective
heuristic method for generalized job shop
scheduling with due dates,” Computers &
industrial engineering, vol. 26, no. 4, pp. 647–660,
1994.
- Demir, H.I. and Taskin, H., “Integrated Process
Planning, Scheduling and Due-Date Assignment,”
PhD Thesis, Sakarya University, 2005.
- Ceven, E. and Demir, H.I., “Benefits of Integrating
Due-Date Assignment with Process Planning and
Scheduling,” Master of Science Thesis, Sakarya
University, 2007.
- H. I. Demir, T. Cakar, Ibrahim Cil, Dugenci,
Muharrem, and Erden, Caner, “Integrating Process
Planning, WMS Dispatching, and WPPW
Weighted Due Date Assignment Using a Genetic
Algorithm,” vol. 3, no. 7, 2016.
- Demir, Halil İbrahim, Cakar, Tarik, Uygun, Ozer,
Simsir, Fuat, and Canpolat, Onur, “Process
Planning and Scheduling with WNOPPT
Weighted Due-Date Assignment where Earliness,
Tardiness and Due-Dates are Penalized,” in
Akademik Platform, Valencia, 2016.
- Demir, Halil İbrahim, Cakar, Tarik, Ipek, Mumtaz,
Erkayman, Burak, and Canpolat, Kadriye,
“Process Planning and Scheduling with PPW DueDate
Assignment Using Hybrid Search,”
International Journal of Science and Technology,
vol. 2, no. 1, pp. 20–38.
- I. Rechenberg, “Cybernetic solution path of an
experimental problem,” 1965.
- H.-P. Schwefel, Numerical optimization of
computer models. John Wiley & Sons, Inc., 1981.