Job Shop Scheduling with Flexible Energy Prices and Time Windows

Andreas Bley () and Andreas Linß ()
Additional contact information
Andreas Bley: Universität Kassel
Andreas Linß: Universität Kassel

A chapter in Operations Research Proceedings 2019, 2020, pp 207-213 from Springer

Abstract: Abstract We consider a variant of the job shop scheduling problem, which considers different operational states of the machines (such as off, ramp up, setup, processing, standby and ramp down) and time-dependent energy prices and aims at minimizing the energy consumption of the machines. We propose an integer programming formulation that uses binary variables to explicitly describe the non-operational periods of the machines and present a branch-and-price approach for its solution. Our computational experiments show that this approach outperforms the natural time-indexed formulation.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-030-48439-2_25

Ordering information: This item can be ordered from
http://www.springer.com/9783030484392

DOI: 10.1007/978-3-030-48439-2_25

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().