A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
From MaRDI portal
Publication:835634
DOI10.1007/s10951-008-0068-6zbMath1168.90472OpenAlexW2123490024MaRDI QIDQ835634
Elena Moretti, Jean-François Cordeau, Gabriella Stecco
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0068-6
Related Items (5)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities ⋮ Time-dependent routing problems: a review ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
Uses Software
Cites Work
- Unnamed Item
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A concise survey of scheduling with time-dependent processing times
- A dynamic vehicle routing problem with time-dependent travel times
- Vehicle dispatching with time-dependent travel times
- Time dependent vehicle routing problem with a multi ant colony system
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
- Scheduling with time dependent processing times: Review and extensions
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- Parallel iterative search methods for vehicle routing problems
- An Introduction to Tabu Search
- Makespan minimization in single-machine scheduling with step-deterioration of processing times
- Single-machine scheduling with time window-dependent processing times
- On-line scheduling with forbidden zones
- Single machine scheduling with step-deteriorating processing times
This page was built for publication: A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine
