New results on two-machine flow-shop scheduling with rejection (Q281786): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-015-9836-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081856428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Rejection / 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: Q4883371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flow shop scheduling problem with an outsourcing option / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with machine cost and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Techniques for scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive multiprocessor 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: A survey on offline scheduling with rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties / rank
 
Normal rank

Latest revision as of 23:28, 11 July 2024

scientific article
Language Label Description Also known as
English
New results on two-machine flow-shop scheduling with rejection
scientific article

    Statements

    New results on two-machine flow-shop scheduling with rejection (English)
    0 references
    11 May 2016
    0 references
    0 references
    scheduling
    0 references
    flow shop
    0 references
    rejection penalty
    0 references
    NP-hard
    0 references
    on-line algorithm
    0 references
    0 references
    0 references
    0 references
    0 references