Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ling-Fa Lu / rank
Normal rank
 
Property / author
 
Property / author: Li-Qi Zhang / rank
Normal rank
 
Property / author
 
Property / author: Ling-Fa Lu / rank
 
Normal rank
Property / author
 
Property / author: Li-Qi Zhang / 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.1007/s10878-016-9992-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2236221321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with rejection / 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: Algorithms and Data Structures / 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: Two-machine flow-shop scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:21, 14 July 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling with production and rejection costs to minimize the maximum earliness
scientific article

    Statements

    Single-machine scheduling with production and rejection costs to minimize the maximum earliness (English)
    0 references
    17 October 2017
    0 references
    scheduling
    0 references
    production cost
    0 references
    rejection cost
    0 references
    maximum earliness
    0 references
    0 references
    0 references

    Identifiers