On a scheduling problem of time deteriorating jobs

DOI10.1006/jcom.1998.0473zbMath0910.68019OpenAlexW2024560569MaRDI QIDQ1271170

Pu Cai, Yixin Zhu, Jin-Yi Cai

Publication date: 16 February 1999

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8466f646eeef4f9ae4a1f1677bc95a83be044c6b

zbMATH Keywords

NP-hardnessscheduling problem

Mathematics Subject Classification ID

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

Related Items

Patients scheduling problems with deferred deteriorated functions ⋮ A concise survey of scheduling with time-dependent processing times ⋮ Scheduling with time-dependent discrepancy times ⋮ A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ Single-machine scheduling with deteriorating jobs ⋮ Optimal composition ordering problems for piecewise linear functions ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization, approximation, and complexity classes
• Efficient heuristics to minimize total flow time with release dates
• Approximating maximum independent sets by excluding subgraphs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Scheduling Deteriorating Jobs on a Single Processor
• V-Shaped Policies for Scheduling Deteriorating Jobs