Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.ejor.2015.02.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038044577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the travelling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time control of freight forwarder transportation networks by integrating multimodal transport chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided Complexity Classification of Dial-a-Ride Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the traveling repairman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic fleet management. Concepts, systems, algorithms \& case studies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing and Scheduling on a Shoreline with Release Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank

Latest revision as of 16:40, 12 July 2024

scientific article
Language Label Description Also known as
English
Solving the traveling repairman problem on a line with general processing times and deadlines
scientific article

    Statements

    Solving the traveling repairman problem on a line with general processing times and deadlines (English)
    0 references
    0 references
    6 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    line-traveling repairman problem
    0 references
    optimal schedules
    0 references
    complexity analysis
    0 references
    branch-and-bound
    0 references
    0 references