A disjunctive graph model and framework for constructing new train schedules (Q2379528): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q319615
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Robert L. Burdett / 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.2008.12.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998885613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Railway Timetabling Using Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic for the train scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Model, Algorithms and Strategy for Train Pathing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge-based system for railway scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Optimization Models for Train Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job scheduling with technical constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic techniques for single line train scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with processing alternatives. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing trains through railway stations: Complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling with blocking and no-wait constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective neighbourhood functions for the flexible job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A repairing technique for the local search of the job-shop problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutation flow shop with buffers: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing Trains Through Railway Stations: Model Formulation and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing trains through a railway station based on a node packing model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria train scheduling for high-speed passenger railroad planning applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches / rank
 
Normal rank

Latest revision as of 14:13, 2 July 2024

scientific article
Language Label Description Also known as
English
A disjunctive graph model and framework for constructing new train schedules
scientific article

    Statements

    A disjunctive graph model and framework for constructing new train schedules (English)
    0 references
    0 references
    0 references
    19 March 2010
    0 references
    train scheduling
    0 references
    job shop scheduling
    0 references

    Identifiers