A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634): 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.1007/s10951-008-0068-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2123490024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with time dependent processing times: Review and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with step-deteriorating processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of scheduling with time-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependent vehicle routing problem with a multi ant colony system / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic vehicle routing problem with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle dispatching with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in single-machine scheduling with step-deterioration of processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling with forbidden zones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with time window-dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel iterative search methods for vehicle routing problems / rank
 
Normal rank

Latest revision as of 21:54, 1 July 2024

scientific article
Language Label Description Also known as
English
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
scientific article

    Statements

    A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2009
    0 references
    single machine scheduling
    0 references
    sequence-dependent
    0 references
    time-dependent
    0 references
    setup times
    0 references
    tabu search
    0 references
    0 references

    Identifiers