A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718): 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.1287/ijoc.2017.0772 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2784652060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parallel Machine Scheduling Problems by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single-machine total tardiness scheduling problem: review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with release times, deadlines and tardiness objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment / 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
Property / cites work
 
Property / cites work: Finding the Pareto-optima for the total and maximum tardiness single machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times / rank
 
Normal rank

Latest revision as of 23:58, 23 July 2024

scientific article; zbMATH DE number 7271631
Language Label Description Also known as
English
A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization
scientific article; zbMATH DE number 7271631

    Statements

    A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2020
    0 references
    prize-collecting
    0 references
    single-machine scheduling
    0 references
    integer linear programming
    0 references
    branch and bound
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references