Scheduling jobs with a stepwise function of change of their values

MaRDI QIDQ4667107zbMATH OpenFDO

Authors Adam Janiak, Adam Kasperski, Tomasz Krysiak

Publication date 19 April 2005

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A problem of scheduling jobs with non-monotonic stepwise values
• Scheduling with step-deteriorating jobs to minimize the makespan
• Batch scheduling of step deteriorating jobs
• Scheduling with step-improving processing times
• Scheduling jobs with position-dependent processing times
• Scheduling jobs with piecewise linear decreasing processing times
• Scheduling jobs with varying processing times
• Scheduling dedicated jobs with variative processing times
• Scheduling jobs on parallel machines to minimize a regular step total cost function

Cited in

(2)

• A problem of scheduling jobs with non-monotonic stepwise values
• Single processor scheduling with job values depending on their completion times

This page was built for publication: Scheduling jobs with a stepwise function of change of their values

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