Conjugate problems in time-dependent scheduling
In the paper, we consider conjugate problems which constitute a new class of mutually related time-dependent scheduling problems. Any element from this class is a composite problem, being a pair of two time-dependent scheduling problems connected by a conjugacy formula. We prove basic properties of conjugate problems and show the relations that hold between such problems. We also propose an approach to the construction of greedy heuristics for the conjugate problems. We illustrate applications of the results by examples.
KeywordsTime-dependent scheduling Conjugate problems Heuristic algorithms
Unable to display preview. Download preview PDF.
- Błażewicz, J., & Gawiejnowicz, S. (1999). Scheduling tasks and vehicles in a flexible manufacturing system subject to mean flow time minimization. Foundations of Computing and Decision Sciences, 24, 1–12. Google Scholar
- Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer. Google Scholar
- Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison-Wesley. Google Scholar
- Gawiejnowicz, S. (1996b). Brief survey of continuous models of scheduling. Foundations of Computing and Decision Sciences, 21, 81–100. Google Scholar
- Gawiejnowicz, S. (2008). Time-dependent scheduling. Monographs in theoretical computer science. An EATCS Series. Springer, Berlin. Google Scholar
- Gawiejnowicz, S., Kurc, W., & Pankowska, L. (2002). A greedy approach for a time-dependent scheduling problem. In Lecture notes in computer science (Vol. 2328, pp. 79–86). Google Scholar