Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 7 - Network Environment: Basics

  • from Part II - Basic Methods
  • Christos T. Maravelias, Princeton University, New Jersey
  • Book:
    Chemical Production Scheduling
    Published online:
    01 May 2021
    Print publication:
    06 May 2021, pp 157-190

  • Summary

    In this chapter, we discuss scheduling in network environments that are unique in the process industries. We study the basic features of this class of problems, including tasks consuming and producing multiple materials, shared utilities, and time-varying utility cost and capacity. In the next chapter, we will consider additional features, including material consumption and production during batch execution, material transfer activities, and unit deterioration. Problems in sequential environments can be expressed using the traditional representation based on batches (orders), stages (operations), and units (machines). This representation is insufficient for problems in network environments. Thus, we start in Section 7.1 with two frameworks, the so-called state-task network (STN) and resource-task network (RTN), for problem representation and the corresponding problem statements. In Section 7.2, we present two models based on a common discrete time grid, and in Section 7.3 we present a model based on a common continuous time grid.