Abstract
We consider general properties of isomorphic scheduling problems that constitute a new class of pairs of mutually related scheduling problems. Any such a pair is composed of a scheduling problem with fixed job processing times and its time-dependent counterpart with processing times that are proportional-linear functions of the job starting times. In order to introduce the class formally, first we formulate a generic scheduling problem with fixed job processing times and define isomorphic problems by a one-to-one transformation of instances of the generic problem into instances of time-dependent scheduling problems with proportional-linear job processing times. Next, we prove basic properties of isomorphic scheduling problems and show how to convert polynomial algorithms for scheduling problems with fixed job processing times into polynomial algorithms for proportional-linear counterparts of the original problems. Finally, we show how are related approximation algorithms for isomorphic problems. Applying the results, we establish new worst-case results for time-dependent parallel-machine scheduling problems and prove that many single- and dedicated-machine time-dependent scheduling problems with proportional-linear job processing times are polynomially solvable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: review and extensions. J Oper Res Soc, 50, 711–720.
Baptiste, P., Carlier, J., Kononov, A., Queyranne, M., Sevastianov, S., & Sviridenko, M. (2009). Structural properties of optimal preemptive schedules. Discrete Anal Oper Res, 16, 3–36.
Cheng, T. C. E., & Ding, Q. (2000). Single machine scheduling with deadlines and increasing rates of processing times. Acta Inform, 36, 673–692.
Cheng, T. C. E., & Ding, Q. (1998). The complexity of scheduling starting time dependent tasks with release times. Inf Process Lett, 65, 75–79.
Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. Eur J Oper Res, 152, 1–13.
Gawiejnowicz, S. (1996). Brief survey of continuous models of scheduling. Found Comput Decision Sci, 21, 81–100.
Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin–Heidelberg: Springer.
Gawiejnowicz, S., Kurc, W., & Pankowska, L. (2006). Parallel machine scheduling of deteriorating jobs by steepest descent search. Lect Notes Comput Sci, 3911, 116–123.
Gawiejnowicz, S., Kurc, W., & Pankowska, L. (2009a). Equivalent time-dependent scheduling problems. Eur J Oper Res, 196, 919–929.
Gawiejnowicz, S., Kurc, W., & Pankowska, L. (2009b). Conjugate time-dependent scheduling problems. J Sched, 12, 543–553.
Gawiejnowicz, S., & Kononov, A. (2010). Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur J Oper Res, 200, 305–308.
Gawiejnowicz, S., & Lin, B. M. T. (2010). Scheduling time-dependent jobs under mixed deterioration. Appl Math Comput, 216, 438–447.
Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. J ACM, 23, 665–679.
Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell Syst Tech J, 45, 1563–1581.
Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM J Appl Math, 17, 416–429.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math, 4, 287–326.
Johnson, S. M. (1956). Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q, 1, 61–68.
Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum.
Kononov, A. (1996). Combinatorial complexity of scheduling jobs with simple linear deterioration. Discrete Anal Oper Res, 3, 15–32 (in Russian).
Kononov, A. (1998). Single machine scheduling problems with processing times proportional to an arbitrary function. Discrete Anal Oper Res, 5, 17–37 (in Russian).
Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Manag Sci, 19, 544–546.
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, & P. H. Zipkin (Eds.), Logistics of production and inventory (pp. 445–522). Amsterdam: North–Holland.
Lawler, E. L., & Moore, J. M. (1969). A functional equation and its applications to resource allocation and sequencing problems. Manag Sci, 16, 77–84.
Lee, C. Y., Lei, L., & Pinedo, M. (1997). Current trends in deterministic scheduling. Ann Oper Res, 70, 1–41.
Lee, W. C., Wang, W. J., Shiau, Y. R., & Wu, C. C. (2010). A single-machine scheduling problem with two-agent and deteriorating jobs. Appl Math Model, 34, 3098–3107.
Liu, P., Tang, L., & Zhou, X. (2010). Two-agent group scheduling with linear deteriorating jobs on a single machine. Int J Adv Manuf Technol, 47, 657–664.
Lodree, E. J. Jr., & Geiger, C. D. (2010). A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration. Eur J Oper Res, 201, 644–648.
Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manag Sci, 15, 102–109.
Mosheiov, G. (2002). Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl Math, 117, 195–209.
Pinedo, M. (2005). Planning and scheduling in manufacturing and services (2nd ed.). Englewood Cliffs: Prentice-Hall.
Sahni, S. (1976). Algorithms for scheduling independent tasks. J ACM, 22, 115–124.
Strusevich, V. (1991). Two-machine super-shop scheduling problem. J Oper Res Soc, 42, 479–492.
Toksarı, M. D., & Güner, E. (2010). The common due-date early/tardy scheduling problem on a parallel machine under the effects of time-dependent learning and linear and nonlinear deterioration. Expert Syst Appl, 37, 92–112.
Yang, D. L., & Kuo, W. H. (2009). Single-machine scheduling with both deterioration and learning effects. Ann Oper Res, 172, 315–327.
Acknowledgements
The research of Dr. Gawiejnowicz has been supported by National Science Center grant N N519 643340. The research of Dr. Kononov has been supported by RBFR Grant 12-01-00184a.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gawiejnowicz, S., Kononov, A. Isomorphic scheduling problems. Ann Oper Res 213, 131–145 (2014). https://doi.org/10.1007/s10479-012-1222-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-012-1222-2