Carbon-efficient scheduling of flow shops by multi-objective optimization

DOI10.1016/j.ejor.2015.05.019zbMath1346.90338OpenAlexW826685547MaRDI QIDQ320773

Cheng Wu, Jian-Ya Ding, Shi-ji Song

Publication date: 7 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.019

zbMATH Keywords

makespanflow shopcarbon efficiencyextended NEH-insertiontotal energy consumption

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (9)

Trade-off balancing in scheduling for flow shop production and perioperative processes ⋮ A bi-objective flexible flow shop scheduling problem with machine-dependent processing stages: trade-off between production costs and energy consumption ⋮ Minimizing the total tardiness and the total carbon emissions in the permutation flow shop scheduling problem ⋮ Multi-objective energy-efficient hybrid flow shop scheduling using Q-learning and GVNS driven NSGA-II ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ Production planning under RTP, TOU and PPA considering a redox flow battery storage system ⋮ A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion ⋮ Nash-equilibrium algorithm and incentive protocol for a decentralized decision and scheduling problem in sustainable electroplating plants

Cites Work

• Flow shop scheduling with peak power consumption constraints
• Evolving better population distribution and exploration in evolutionary multi-objective optimization
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
• A fast tabu search algorithm for the permutation flow-shop problem
• Flowshop scheduling research after five decades
• On Finding the Maxima of a Set of Vectors
• The Complexity of Flowshop and Jobshop Scheduling
• Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
• New block properties for the permutation flow shop problem with application in tabu search
• Operational methods for minimization of energy consumption of manufacturing equipment

This page was built for publication: Carbon-efficient scheduling of flow shops by multi-objective optimization