Abstract
The main aim of the paper is to construct a greedy algorithm for an approximate polynomial-time solution of a single machine time-dependent scheduling problem. In the problem the processing time p j of each job is described by a function of the starting time t of the job, p j = 1+αj t, where αj > 0 for j = 0,1, 2,..., n. Jobs are non-preemptable and independent, there are neither ready times nor deadlines, and the criterion of optimality is the total completion time.
There are two contributions of the paper. Firstly, some theoretical background for proposed algorithm is presented. In this setting useful notions of signatures for a given sequence of coefficients of the problem are introduced and their properties are considered. Secondly, these general results are applied to the case of the problem when its coefficients are consecutive natural numbers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alidaee, B., Womer, N.K.: Scheduling with time dependent processing times: Review and extensions. J. Optl Res. Soc. 50 (1999) 711–720.
Chen, Z-L.: Parallel machine scheduling with time dependent processing times. Discr. Appl. Math. 70 (1996) 81–93. (Erratum: Discr. Appl. Math. 75 (1996) 103.)
Gawiejnowicz, S.: Brief survey of continuous models of scheduling. Found. Comput. Dec. Sci. 21 (1996) 81–100.
Gawiejnowicz, S., Lai, T-C., Chiang, M-H.: Polynomially solvable cases of scheduling deteriorating jobs to minimize total completion time. In: Brucker, P., et al. (eds.). Extended Abstracts of the 7th Workshop on Project Management and Scheduling, University of Osnabrück, 2000, 131–134.
Gawiejnowicz, S., Pankowska, L.: Scheduling jobs with varying processing times. Inf. Proc. Lett. 54 (1995), 175–178.
Gawiejnowicz, S., Kurc, W., Pankowska, L., Suwalski, C.: Approximate solution of a time-dependent scheduling problem for l p—norm-based criteria. In: Fleischmann, B., et al. (eds.), Operations Research OR2000. Selected Papers of the Symposium on Operations Research, Springer, Berlin (2001) 372–377.
Gawiejnowicz, S., Kurc, W., Pankowska, L.: A greedy approach for a time-dependent scheduling problem. Report 110/2001, Faculty of Mathematics and Computer Science, Adam Mickiewicz University, August 2001.
Hirsch, F., Lacombe, G.: Elements of Functional Analysis. Springer, Berlin Heidelberg (1999).
Kononov, A.V.: Scheduling problems with linear increasing processing times. In: Zimmermann, U., et al. (eds.), Operations Research 1996. Selected Papers of the Symposium on Operations Research, Springer, Berlin (1997) 208–212.
Kononov, A., Gawiejnowicz, S.: NP-hard cases in scheduling deteriorating jobs on dedicated machines. J. Optl Res. Soc. 52 (2001) 708–717.
Mosheiov, G.: V-shaped policies for scheduling deteriorating jobs. Oper. Res. 39 (1991) 979–991.
Mosheiov, G.: Scheduling jobs under simple linear deterioration. Comp. Oper. Res. 21 (1994) 653–659.
Tanaev, V.S., Gordon, V.S., Shafransky, Y.M.: Scheduling Theory. Single-Stage Systems. Kluwer, Dordrecht (1994).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gawiejnowicz, S., Kurc, W., Pankowska, L. (2002). A Greedy Approach for a Time-Dependent Scheduling Problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2001. Lecture Notes in Computer Science, vol 2328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48086-2_9
Download citation
DOI: https://doi.org/10.1007/3-540-48086-2_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43792-5
Online ISBN: 978-3-540-48086-0
eBook Packages: Springer Book Archive