Storage problems in batch scheduling

Schwindt, Christoph; Trautmann, Norbert (2002). Storage problems in batch scheduling. In: Chamoni, P.; Leisten, R.; Martin, A.; Minnemann, J.; Stadtler, H. (eds.) Operations Research Proceedings 2001 (pp. 213-218). Berlin: Springer

Full text not available from this repository. (Request a copy)

This paper is concerned with the modelling of storage configurations for intermediate products in process industries. Those models form the basis of algorithms for scheduling chemical production plants. Different storage capacity settings (unlimited, finite, and no intermediate storage), storage homogeneity settings (dedicated and shared storage), and storage time settings (unlimited, finite, and no wait) are considered. We discuss a classification of storage constraints in batch scheduling and show how those constraints can be integrated into a general production scheduling model that is based on the concept of cumulative resources.

Item Type:

Conference or Workshop Item (Paper)

Division/Institute:

03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Trautmann, Norbert

Subjects:

600 Technology > 650 Management & public relations

ISBN:

978-3-642-50282-8

Publisher:

Springer

Language:

English

Submitter:

Larissa Notz

Date Deposited:

23 May 2014 08:28

Last Modified:

31 Jul 2017 08:20

URI:

https://boris.unibe.ch/id/eprint/49136

Actions (login required)

Edit item Edit item
Provide Feedback