Scheduling on identical parallel machines with controllable processing times to minimize the makespan

Daniel Oron, Dvir Shabtay, George Steiner

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Scheduling with controllable processing times has been the focus of extensive
research for the last three decades, see Shabtay and Steiner [5] for a survey.
In contrast to the common assumption in deterministic scheduling saying that
job processing times are constant values, in scheduling with controllable processing times the job durations are controllable through the allocation of resources to job operations. In this talk, we consider a problem of this type.
Original languageEnglish GB
Title of host publicationThe First International Workshop on Dynamic Scheduling Problems
EditorsStanisław Gawiejnowicz
Place of PublicationPoland
PublisherPolish Mathematical Society
Pages61-64
ISBN (Electronic)978-83-937220-7-5
StatePublished - 2016

Fingerprint

Dive into the research topics of 'Scheduling on identical parallel machines with controllable processing times to minimize the makespan'. Together they form a unique fingerprint.

Cite this