论文信息 - A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs

A Note on Scheduling on a Single Processor with Speed Dependent on a Number of Executed Jobs

In this note the makespan scheduling problem on a single processor is considered. The speed of a processor depends on the number of already processed jobs and is described by a function. Several polynomial-time algorithms for finding an optimal schedule are given.

Stanislaw Gawiejnowicz | Stanisław Gawiejnowicz

[1] Jan Karel Lenstra,et al. Parallel machine scheduling: processing rates dependent on number of jobs in operation , 1987 .

[2] Jatinder N. D. Gupta,et al. Single facility scheduling with nonlinear processing times , 1988 .

[3] Gur Mosheiov,et al. Scheduling jobs under simple linear deterioration , 1994, Comput. Oper. Res..

[4] Stanislaw Gawiejnowicz,et al. Scheduling Jobs with Varying Processing Times , 1995, Inf. Process. Lett..

[5] Jacek Blazewicz,et al. Scheduling in Computer and Manufacturing Systems , 1990 .

[6] Jan Weglarz,et al. Multiprocessor Scheduling with Memory Allocation - A Deterministic Approach , 1980, IEEE Trans. Computers.

[7] Joseph Y.-T. Leung,et al. Complexity of Scheduling Tasks with Time-Dependent Execution Times , 1993, Inf. Process. Lett..

[8] Sid Browne,et al. Scheduling Deteriorating Jobs on a Single Processor , 1990, Oper. Res..

[9] Wieslaw Kubiak,et al. Scheduling deteriorating jobs to minimize makespan , 1998 .