IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v11y2019i5p1498-d213174.html

Sustainable Scheduling of an Automatic Pallet Changer System by Multi-Objective Evolutionary Algorithm with First Piece Inspection

Author

Listed:
  • Qingmiao Liao

    (School of Mechanical Engineering and Automation, Beihang University, Beijing 100191, China)

  • Jianjun Yang

    (School of Mechanical Engineering and Automation, Beihang University, Beijing 100191, China)

  • Yong Zhou

    (School of Mechanical Engineering and Automation, Beihang University, Beijing 100191, China)

Abstract

In this study, the machining center with the Automated Pallet Changer (APC) scheduling problem considering the disturbance of the first piece inspection is presented. The APC is frequently used in industry practice; it is useful in terms of sustainability and robustness because it increases the machine utilization rate and enhances the responsiveness to uncertainties in dynamic environments. An enhanced evolutionary algorithm for APC scheduling (APCEA) is developed by combining the multi-objective evolutionary algorithm with APC simulation. The dynamic factors in the simulation model include the pass rate of the first piece inspection (FPI) and the adjusted time when the FPI is unpassed. The proposed APCEA defines the non-robust gene based on the risk combination of the first piece inspection, and screens the non-robust gene in the genetic operation, thus improving the solution quality under the same computation times. Compared with the other three multi-objective evolutionary algorithms (MOEAs), it is demonstrated that the proposed APCEA produces the best result among the four methods. The proposed APCEA has been embedded into the manufacturing execution system (MES) and successfully applied in a manufacturing plant. The application value of the proposed method is verified by a practical example.

Suggested Citation

  • Qingmiao Liao & Jianjun Yang & Yong Zhou, 2019. "Sustainable Scheduling of an Automatic Pallet Changer System by Multi-Objective Evolutionary Algorithm with First Piece Inspection," Sustainability, MDPI, vol. 11(5), pages 1-24, March.
    • Handle: RePEc:gam:jsusta:v:11:y:2019:i:5:p:1498-:d:213174
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/11/5/1498/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/11/5/1498/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    2. Hyun Cheol Lee & Chunghun Ha, 2019. "Sustainable Integrated Process Planning and Scheduling Optimization Using a Genetic Algorithm with an Integrated Chromosome Representation," Sustainability, MDPI, vol. 11(2), pages 1-23, January.
    3. Rui Zhang, 2017. "Sustainable Scheduling of Cloth Production Processes by Multi-Objective Genetic Algorithm with Tabu-Enhanced Local Search," Sustainability, MDPI, vol. 9(10), pages 1-26, September.
    4. Alcaide, D. & Rodriguez-Gonzalez, A. & Sicilia, J., 2002. "An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns," European Journal of Operational Research, Elsevier, vol. 140(2), pages 384-398, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Muhammad Riaz & Aamir Hanif & Haris Masood & Muhammad Attique Khan & Kamran Afaq & Byeong-Gwon Kang & Yunyoung Nam, 2021. "An Optimal Power Flow Solution of a System Integrated with Renewable Sources Using a Hybrid Optimizer," Sustainability, MDPI, vol. 13(23), pages 1-12, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    2. Binzi Xu & Kai Xu & Baolin Fei & Dengchao Huang & Liang Tao & Yan Wang, 2024. "Automatic Design of Energy-Efficient Dispatching Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling Based on Dual Feature Weight Sets," Mathematics, MDPI, vol. 12(10), pages 1-24, May.
    3. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    4. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    5. Mohammad Reza Hosseinzadeh & Mehdi Heydari & Mohammad Mahdavi Mazdeh, 2022. "Mathematical modeling and two metaheuristic algorithms for integrated process planning and group scheduling with sequence-dependent setup time," Operational Research, Springer, vol. 22(5), pages 5055-5105, November.
    6. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    7. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    8. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    9. Chen, Haoxun & Luh, Peter B., 2003. "An alternative framework to Lagrangian relaxation approach for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 149(3), pages 499-512, September.
    10. Land, Martin & Gaalman, Gerard, 1996. "Workload control concepts in job shops A critical assessment," International Journal of Production Economics, Elsevier, vol. 46(1), pages 535-548, December.
    11. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Branke, Juergen & Pickardt, Christoph W., 2011. "Evolutionary search for difficult problem instances to support the design of job shop dispatching rules," European Journal of Operational Research, Elsevier, vol. 212(1), pages 22-32, July.
    14. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    15. Reményi, Christoph & Staudacher, Stephan, 2014. "Systematic simulation based approach for the identification and implementation of a scheduling rule in the aircraft engine maintenance," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 94-107.
    16. Beemsterboer, Bart & Land, Martin & Teunter, Ruud & Bokhorst, Jos, 2017. "Integrating make-to-order and make-to-stock in job shop control," International Journal of Production Economics, Elsevier, vol. 185(C), pages 1-10.
    17. Seifert, Ralf W. & Morito, Susumu, 2001. "Cooperative dispatching - exploiting the flexibility of an FMS by means of incremental optimization," European Journal of Operational Research, Elsevier, vol. 129(1), pages 116-133, February.
    18. Heng Zhang & Utpal Roy, 2019. "A semantics-based dispatching rule selection approach for job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2759-2779, October.
    19. repec:dgr:rugsom:95a42 is not listed on IDEAS
    20. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.
    21. Wenzhu Liao & Tong Wang, 2018. "Promoting Green and Sustainability: A Multi-Objective Optimization Method for the Job-Shop Scheduling Problem," Sustainability, MDPI, vol. 10(11), pages 1-19, November.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:11:y:2019:i:5:p:1498-:d:213174. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager The email address of this maintainer does not seem to be valid anymore. Please ask MDPI Indexing Manager to update the entry or send us the correct address (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.