A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem

DOI10.1155/2013/546810zbMath1299.90235OpenAlexW2082423416WikidataQ59026507 ScholiaQ59026507MaRDI QIDQ473807

Hai-Dong Yang, Guo-Sheng Liu, George Q. Huang, Bi-Xi Zhang, Xin Chen

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/546810

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (1)

Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption

Cites Work

• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
• Optimal two- and three-stage production schedules with setup times included
• Fifty years of scheduling: a survey of milestones
• Scheduling multiple products on parallel machines with setup costs

This page was built for publication: A branch-and-bound algorithm for minimizing the energy consumption in the PFS problem