Performance guarantees for a scheduling problem with common stepwise job payoffs (Q476886): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375990 / rank
 
Normal rank
Property / zbMATH Keywords
 
absolute approximation guarantee
Property / zbMATH Keywords: absolute approximation guarantee / rank
 
Normal rank
Property / zbMATH Keywords
 
relative approximation guarantee
Property / zbMATH Keywords: relative approximation guarantee / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
stepwise payoffs
Property / zbMATH Keywords: stepwise payoffs / rank
 
Normal rank
Property / zbMATH Keywords
 
release dates
Property / zbMATH Keywords: release dates / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2014.10.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2093589474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with delivery dates and cumulative payoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for scheduling jobs with regular step cost functions on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single processor scheduling with job values depending on their completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on parallel machines to minimize a regular step total cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with stepwise tardiness costs and release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Fixed Delivery Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized due date scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 08:53, 9 July 2024

scientific article
Language Label Description Also known as
English
Performance guarantees for a scheduling problem with common stepwise job payoffs
scientific article

    Statements

    Performance guarantees for a scheduling problem with common stepwise job payoffs (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    absolute approximation guarantee
    0 references
    relative approximation guarantee
    0 references
    scheduling
    0 references
    stepwise payoffs
    0 references
    release dates
    0 references

    Identifiers