82. Job scheduling in time-dependent shop systems
Invited abstract in session TC-2: Scheduling , stream Scheduling.
Thursday, 11:30 - 13:00Room: M228
Authors (first author is the speaker)
| 1. | Stanislaw Gawiejnowicz
|
| Faculty of Mathematics and Computer Science, Adam Mickiewicz University in Poznan |
Abstract
We consider time-dependent scheduling on two or three shop machines. The processing times of jobs are proportional functions of the job starting times, there are no precedence constraints among jobs, and the criterion of schedule optimality is the maximum completion time. We prove that some two-machine problems of this type can be solved in a polynomial time with the use of appropriately modified rule or an algorithm known earlier for counterparts of these problems with fixed job processing times. We also show, based on results of conducted numerical experiments, that similarly modified other rules for classic shop scheduling problems generate near-optimal schedules for three-machine time-dependent shop problems of this type.
Keywords
- Scheduling
- Algorithms
- Heuristics and meta-heuristics
Status: accepted
Back to the list of papers