The lockmaster's problem (Q322695): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Greet vanden Berghe / rank
Normal rank
 
Property / author
 
Property / author: Greet vanden Berghe / rank
Normal rank
 
Property / author
 
Property / author: Greet vanden Berghe / 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.1016/j.ejor.2015.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3122013344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Economic Lot Size Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch processing machine with bipartite compatibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lockmaster's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel batch scheduling of equal-length jobs with release and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch processing with interval graph compatibilities between tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lockmaster's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Scheduling System for the Welland Canal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation of alternative approaches to relieving congestion at locks in a river transportion system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic methods for placing ships in locks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 17:09, 12 July 2024

scientific article
Language Label Description Also known as
English
The lockmaster's problem
scientific article

    Statements

    The lockmaster's problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    transportation
    0 references
    lock scheduling
    0 references
    batch scheduling
    0 references
    dynamic programming
    0 references
    complexity
    0 references
    0 references
    0 references