Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption
type: Item
instance of: scholarly article
title: Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption
zbMATH Open document ID: 1547.90078
DOI: 10.1007/978-3-031-24907-5_68
author: Andreas Bley
author: Andreas Linß
publication date: 2024-09-17T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7914511
zbMATH Keywords: integer programming
zbMATH Keywords: machine scheduling
zbMATH Keywords: presolving
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
cites work: Presolve Reductions in Mixed Integer Programming
cites work: Energy-aware production scheduling with power-saving modes
cites work: Job shop scheduling with flexible energy prices and time windows
cites work: Scheduling and constraint propagation
cites work: Deterministic job-shop scheduling: Past, present and future
cites work: A polyhedral approach to single-machine scheduling problems.
description: scientific article; zbMATH DE number 7914511