Advanced search
Publication Cover
Journal of the Operational Research Society Volume 71, 2020 - Issue 6
Submit an article Journal homepage
536
Views
18
CrossRef citations to date
0
Altmetric
Articles

Green parallel machines scheduling problem: A bi-objective model and a heuristic algorithm to obtain Pareto frontier

Arash ZandiDepartment of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran;
,
Reza RamezanianDepartment of Industrial Engineering, K. N. Toosi University of Technology, Tehran, Iran; Correspondence[email protected]
&
Leslie MonplaisirDepartment of Industrial and Systems Engineering, Wayne State University, Detroit, Michigan, USA
Pages 967-978 | Received 30 Apr 2018, Accepted 08 Mar 2019, Published online: 29 May 2019

Citations (18)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (4)

Yusheng Wang, Ada Che & Jianguang Feng. (2023) Energy-efficient unrelated parallel machine scheduling with general position-based deterioration. International Journal of Production Research 61:17, pages 5886-5900.
Read now
Mengxing Gao, ChenGuang Liu, Zigui Liu & Xi Chen. (2023) A tabu search algorithm for the unrelated parallel machine scheduling problem with varied carbon emission constraints in different time intervals. Journal of the Operational Research Society 0:0, pages 1-15.
Read now
Reza Gharoie Ahangar, Robert Pavur & Hani Gharavi. (2022) A global optima search field division method for evolutionary algorithms. Journal of the Operational Research Society 73:5, pages 1085-1104.
Read now
Kan Fang, Wenchang Luo & Ada Che. (2021) Speed scaling in two-machine lot-streaming flow shops with consistent sublots. Journal of the Operational Research Society 72:11, pages 2429-2441.
Read now

Articles from other publishers (14)

Melis Alpaslan Takan. (2024) A novel MIP model and a hybrid genetic algorithm for operation outsourcing in production scheduling with carbon tax policy. Expert Systems with Applications 251, pages 123983.
Crossref
Younggyu Bok, Na Kyung Lee, Sugyeong Jo, Seokgi Lee, Sang Jin Kweon & Hyeong Suk Na. (2024) The production scheduling problem employing non-identical parallel machines with due dates considering carbon emissions and multiple types of energy sources. Expert Systems with Applications 238, pages 121990.
Crossref
Ahmed Missaoui, Cemalettin Ozturk, Barry O’Sullivan & Michele Garraffa. 2023. Handbook of Formal Optimization. Handbook of Formal Optimization 1 26 .
Jie Lian, Wenjuan Li, Guoli Pu & Pengwei Zhang. (2023) Bi-objective energy-efficient scheduling in a seru production system considering reconfiguration of serus. Sustainable Computing: Informatics and Systems 39, pages 100900.
Crossref
Yiwei Jiang, Xuelian Tang, Kai Li, T.C.E. Cheng & Min Ji. (2023) Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing. Computers & Industrial Engineering 176, pages 108949.
Crossref
Darleen Dolch & Rainer Lasch. 2023. Logistics Management. Logistics Management 209 228 .
Kai Li, Han Zhang, Chengbin Chu, Zhao-hong Jia & Jianfu Chen. (2022) A bi-objective evolutionary algorithm scheduled on uniform parallel batch processing machines. Expert Systems with Applications 204, pages 117487.
Crossref
Preechaya Chavalittumrong & Mark Speece. (2022) Three-Pillar Sustainability and Brand Image: A Qualitative Investigation in Thailand’s Household Durables Industry. Sustainability 14:18, pages 11699.
Crossref
Xiao Wu, Peng Guo, Yi Wang & Yakun Wang. (2021) Decomposition approaches for parallel machine scheduling of step-deteriorating jobs to minimize total tardiness and energy consumption. Complex & Intelligent Systems 8:2, pages 1339-1354.
Crossref
Gulcin Bektur. (2021) An NSGA-II-Based Memetic Algorithm for an Energy-Efficient Unrelated Parallel Machine Scheduling Problem with Machine-Sequence Dependent Setup Times and Learning Effect. Arabian Journal for Science and Engineering 47:3, pages 3773-3788.
Crossref
Linna Cheng, Changfeng Zhu, Qingrong Wang, Wenxian Wang, Zhengkun Zhang & Wenjun Sun. (2021) Skip‐stop operation plan for urban rail transit considering bounded rationality of passengers. IET Intelligent Transport Systems 16:1, pages 24-40.
Crossref
Paolo Renna & Sergio Materi. (2021) A Literature Review of Energy Efficiency and Sustainability in Manufacturing Systems. Applied Sciences 11:16, pages 7366.
Crossref
Papimol Kongsri & Jirachai Buddhakulsomsiri. (2020) A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness. A Mixed Integer Programming Model for Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Time to Minimize Makespan and Total Tardiness.
Hossein Saberi-Aliabad, Mohammad Reisi-Nafchi & Ghasem Moslehi. (2020) Energy-efficient scheduling in an unrelated parallel-machine environment under time-of-use electricity tariffs. Journal of Cleaner Production 249, pages 119393.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.