scientific article; zbMATH DE number 2086777

MaRDI QIDQ4737345zbMATH OpenFDO

Authors Stanisław Gawiejnowicz, Wiesław Kurc, Lidia Pankowska

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2328/23280079.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
• scientific article; zbMATH DE number 6378894
• scientific article; zbMATH DE number 1859344
• Single-machine scheduling problems with start-time dependent processing time
• Scheduling jobs with varying processing times

Cited in

(12)

• Conjugate problems in time-dependent scheduling
• Equivalent time-dependent scheduling problems
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
• A concise survey of scheduling with time-dependent processing times
• A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• scientific article; zbMATH DE number 6378894 (Why is no real title available?)
• scientific article; zbMATH DE number 1859344 (Why is no real title available?)
• Theory and methodology of time-dependent scheduling: past, present and future
• Scheduling algorithms for procrastinators

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737345)