IDEAS home Printed from https://ideas.repec.org/a/gam/jijerp/v15y2017i1p32-d124365.html
   My bibliography  Save this article

Environment-Aware Production Scheduling for Paint Shops in Automobile Manufacturing: A Multi-Objective Optimization Approach

Author

Listed:
  • Rui Zhang

    (School of Economics and Management, Xiamen University of Technology, Xiamen 361024, China)

Abstract

The traditional way of scheduling production processes often focuses on profit-driven goals (such as cycle time or material cost) while tending to overlook the negative impacts of manufacturing activities on the environment in the form of carbon emissions and other undesirable by-products. To bridge the gap, this paper investigates an environment-aware production scheduling problem that arises from a typical paint shop in the automobile manufacturing industry. In the studied problem, an objective function is defined to minimize the emission of chemical pollutants caused by the cleaning of painting devices which must be performed each time before a color change occurs. Meanwhile, minimization of due date violations in the downstream assembly shop is also considered because the two shops are interrelated and connected by a limited-capacity buffer. First, we have developed a mixed-integer programming formulation to describe this bi-objective optimization problem. Then, to solve problems of practical size, we have proposed a novel multi-objective particle swarm optimization (MOPSO) algorithm characterized by problem-specific improvement strategies. A branch-and-bound algorithm is designed for accurately assessing the most promising solutions. Finally, extensive computational experiments have shown that the proposed MOPSO is able to match the solution quality of an exact solver on small instances and outperform two state-of-the-art multi-objective optimizers in literature on large instances with up to 200 cars.

Suggested Citation

  • Rui Zhang, 2017. "Environment-Aware Production Scheduling for Paint Shops in Automobile Manufacturing: A Multi-Objective Optimization Approach," IJERPH, MDPI, vol. 15(1), pages 1-32, December.
  • Handle: RePEc:gam:jijerp:v:15:y:2017:i:1:p:32-:d:124365
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1660-4601/15/1/32/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1660-4601/15/1/32/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ari P. J. Vepsalainen & Thomas E. Morton, 1987. "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, INFORMS, vol. 33(8), pages 1035-1047, August.
    2. Stephan A. Hartmann & Thomas A. Runkler, 2008. "Online Optimization of a Color Sorting Assembly Buffer Using Ant Colony Optimization," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 415-420, Springer.
    3. Estellon, Bertrand & Gardi, Frédéric & Nouioua, Karim, 2008. "Two local search approaches for solving real-life car sequencing problems," European Journal of Operational Research, Elsevier, vol. 191(3), pages 928-944, December.
    4. Briant, Olivier & Naddef, Denis & Mounié, Grégory, 2008. "Greedy approach and multi-criteria simulated annealing for the car sequencing problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 993-1003, December.
    5. Solnon, Christine & Cung, Van Dat & Nguyen, Alain & Artigues, Christian, 2008. "The car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem," European Journal of Operational Research, Elsevier, vol. 191(3), pages 912-927, December.
    6. Tan, K.C. & Goh, C.K. & Yang, Y.J. & Lee, T.H., 2006. "Evolving better population distribution and exploration in evolutionary multi-objective optimization," European Journal of Operational Research, Elsevier, vol. 171(2), pages 463-495, June.
    7. B Estellon & F Gardi, 2013. "Car sequencing is NP-hard: a short proof," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(10), pages 1503-1504, October.
    8. Ribeiro, Celso C. & Aloise, Daniel & Noronha, Thiago F. & Rocha, Caroline & Urrutia, Sebastián, 2008. "A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints," European Journal of Operational Research, Elsevier, vol. 191(3), pages 981-992, December.
    9. Hui Sun & Shujin Fan & Xianle Shao & Jiangong Zhou, 2015. "A colour-batching problem using selectivity banks in automobile paint shops," International Journal of Production Research, Taylor & Francis Journals, vol. 53(4), pages 1124-1142, February.
    10. Joseph Y.-T. Leung & Gilbert H. Young, 1990. "Minimizing Total Tardiness on a Single Machine with Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 2(4), pages 346-352, November.
    11. Uli Golle & Franz Rothlauf & Nils Boysen, 2015. "Iterative beam search for car sequencing," Annals of Operations Research, Springer, vol. 226(1), pages 239-254, March.
    12. Ling-Yun He & Jia-Jia Ou, 2017. "Pollution Emissions, Environmental Policy, and Marginal Abatement Costs," IJERPH, MDPI, vol. 14(12), pages 1-16, December.
    13. Gavranovic, Haris, 2008. "Local search and suffix tree for car-sequencing problem with colors," European Journal of Operational Research, Elsevier, vol. 191(3), pages 972-980, December.
    Full references (including those not matched with items on IDEAS)

    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. Pontes, Lara & Neves, Carlos & Subramanian, Anand & Battarra, Maria, 2024. "The maximum length car sequencing problem," European Journal of Operational Research, Elsevier, vol. 316(2), pages 707-717.
    2. Parames Chutima & Sathaporn Olarnviwatchai, 2018. "A multi-objective car sequencing problem on two-sided assembly lines," Journal of Intelligent Manufacturing, Springer, vol. 29(7), pages 1617-1636, October.
    3. Eivind Jahren & Roberto Asín Achá, 2018. "A column generation approach and new bounds for the car sequencing problem," Annals of Operations Research, Springer, vol. 264(1), pages 193-211, May.
    4. Yuan Sun & Samuel Esler & Dhananjay Thiruvady & Andreas T. Ernst & Xiaodong Li & Kerri Morgan, 2024. "Instance space analysis for the car sequencing problem," Annals of Operations Research, Springer, vol. 341(1), pages 41-69, October.
    5. Boysen, Nils & Scholl, Armin & Wopperer, Nico, 2012. "Resequencing of mixed-model assembly lines: Survey and research agenda," European Journal of Operational Research, Elsevier, vol. 216(3), pages 594-604.
    6. Uli Golle & Franz Rothlauf & Nils Boysen, 2015. "Iterative beam search for car sequencing," Annals of Operations Research, Springer, vol. 226(1), pages 239-254, March.
    7. Markó Horváth & Tamás Kis, 2020. "Polyhedral results for position-based scheduling of chains on a single machine," Annals of Operations Research, Springer, vol. 284(1), pages 283-322, January.
    8. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    9. Iwona Paprocka & Damian Krenczyk, 2023. "On Energy Consumption and Productivity in a Mixed-Model Assembly Line Sequencing Problem," Energies, MDPI, vol. 16(20), pages 1-19, October.
    10. Thorben Krueger & Achim Koberstein & Norbert Bittner, 2022. "Anticipating technical car sequencing rules in the master production scheduling of mixed-model assembly lines," Flexible Services and Manufacturing Journal, Springer, vol. 34(2), pages 351-407, June.
    11. Zhang, Rui & Chang, Pei-Chann & Wu, Cheng, 2013. "A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production," International Journal of Production Economics, Elsevier, vol. 145(1), pages 38-52.
    12. D. Prot & O. Bellenguez-Morineau, 2018. "A survey on how the structure of precedence constraints may change the complexity class of scheduling problems," Journal of Scheduling, Springer, vol. 21(1), pages 3-16, February.
    13. Elahi, Mirza M. Lutfe & Rajpurohit, Karthik & Rosenberger, Jay M. & Zaruba, Gergely & Priest, John, 2015. "Optimizing real-time vehicle sequencing of a paint shop conveyor system," Omega, Elsevier, vol. 55(C), pages 61-72.
    14. Alidaee, Bahram & Kochenberger, Gary A. & Amini, Mohammad M., 2001. "Greedy solutions of selection and ordering problems," European Journal of Operational Research, Elsevier, vol. 134(1), pages 203-215, October.
    15. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    16. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    17. Maria Anna Huka & Christian Rindler & Manfred Gronalt, 2021. "Scheduling and loading problem for multiple, identical dry kilns," Flexible Services and Manufacturing Journal, Springer, vol. 33(2), pages 312-336, June.
    18. Golle, Uli & Rothlauf, Franz & Boysen, Nils, 2014. "Car sequencing versus mixed-model sequencing: A computational study," European Journal of Operational Research, Elsevier, vol. 237(1), pages 50-61.
    19. Valente, Jorge M.S., 2007. "Improving the performance of the ATC dispatch rule by using workload data to determine the lookahead parameter value," International Journal of Production Economics, Elsevier, vol. 106(2), pages 563-573, April.
    20. Elif Elcin Gunay & Ufuk Kula, 2017. "A stochastic programming model for resequencing buffer content optimisation in mixed-model assembly lines," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2897-2912, May.

    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:jijerp:v:15:y:2017:i:1:p:32-:d:124365. 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 (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.