2639. Scheduling two-stage processing with job-dependent storage requirements
Invited abstract in session MD-12: Flow shop scheduling and line balancing, stream Scheduling and Project Management.
Monday, 14:30-16:00Room: Clarendon SR 1.02
Authors (first author is the speaker)
| 1. | Yakov Zinder
|
| University of Technology Sydney | |
| 2. | Joanna Berlińska
|
| Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Poznań | |
| 3. | Charlie Peter
|
| University of Technology Sydney |
Abstract
This talk considers machine scheduling problems where each job consists of two operations that must be processed in a given order. For processing, a job requires an additional resource referred to as a storage space. The storage space required by a job is seized by the job from the start of processing its first operation and is released upon completion of the second operation. This distinguishes the discussed scheduling problems from the most of the literature on resource-constrained scheduling, where the resource is used only during the processing on a machine, i.e. the resource is seized at the start of processing an operation and is released upon completion of that operation. It also distinguishes the considered scheduling problems from the publications on scheduling with a buffer, where the storage space, usually referred to as a buffer, is used only between the completion of the first operation and the beginning of processing the second operation. The storage space is limited and its consumption varies from job to job. At any point in time, the total consumption of the storage space cannot exceed its availability. Research on two-stage processing scheduling with job-dependent storage requirements has been motivated by various applications, including multimedia systems; data gathering in networks; and supply chains of mineral resources. The talk reviews published results and presents new ones, including exact and approximation algorithms, and metaheuristics.
Keywords
- Scheduling
- Algorithms
- Combinatorial Optimization
Status: accepted
Back to the list of papers