Penalty cost constrained identical parallel machine scheduling problem (Q897945): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
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.2015.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1854554296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for scheduling on parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for parallel batch scheduling with rejection and dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with rejection and non-identical job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling linear deteriorating jobs with rejection on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / 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: Preemptive scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation schemes for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded single-machine parallel-batch scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a single parallel batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriteria approach to scheduling a single machine with job rejection and positional penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with release dates and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling under the job rejection constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Rejection to Minimize the Makespan / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:47, 11 July 2024

scientific article
Language Label Description Also known as
English
Penalty cost constrained identical parallel machine scheduling problem
scientific article

    Statements

    Penalty cost constrained identical parallel machine scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    scheduling
    0 references
    rejection penalty
    0 references
    approximation algorithms
    0 references
    polynomial time approximation scheme
    0 references
    fully polynomial time approximation scheme
    0 references
    0 references

    Identifiers