Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem

DOI10.1142/S0217595918500410zbMath1407.90163OpenAlexW2900896664MaRDI QIDQ4561176

Guo-Sheng Liu, Ying-Si Tang, Jin Jin Li

Publication date: 10 December 2018

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595918500410

zbMATH Keywords

schedulingheuristic algorithmpermutation flow shopenergy saving optimizationidle energy consumption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Energy-efficient scheduling in manufacturing companies: a review and research framework
• Green scheduling of a two-machine flowshop: trade-off between makespan and energy consumption
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines
• The flow shop problem with no-idle constraints: a review and approximation
• Energy-efficient bi-objective single-machine scheduling with power-down mechanism
• Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines
• An improved NEH heuristic to minimize makespan in permutation flow shops
• Optimal two- and three-stage production schedules with setup times included
• Fifty years of scheduling: a survey of milestones
• Operational methods for minimization of energy consumption of manufacturing equipment
• A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
• Scheduling

This page was built for publication: Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem