Single processor scheduling with job values depending on their completion times

DOI10.1007/s10951-006-0004-6zbMath1154.90462OpenAlexW1971744510MaRDI QIDQ880588

Adam Janiak, Tomasz Krysiak

Publication date: 15 May 2007

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

Full work available at URL: https://doi.org/10.1007/s10951-006-0004-6

zbMATH Keywords

NP-hardnessSingle processorHeuristicPolynomial timeJob value

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times ⋮ A branch and bound algorithm for single machine scheduling with deteriorating values of jobs ⋮ Single machine scheduling with delivery dates and cumulative payoffs ⋮ Single machine group scheduling with time and position dependent processing times ⋮ Performance guarantees for a scheduling problem with common stepwise job payoffs ⋮ Minimization of the total completion time for asynchronous transmission in a packet data-transmission system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast approximation algorithm for job sequencing with deadlines
• Scheduling with batching: A review
• Linear-Time Algorithms for Scheduling on Parallel Processors
• Algorithms for Scheduling Independent Tasks
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems