Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
From MaRDI portal
Publication:2370333
DOI10.1016/j.ejor.2006.09.077zbMath1127.90021OpenAlexW2069175855MaRDI QIDQ2370333
Vinicius Amaral Armentano, Moacir Felizardo de França Filho
Publication date: 25 June 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10057/3420
Related Items (12)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ Integrated production and logistics planning: contract manufacturing and choice of air/surface transportation ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics ⋮ Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Greedy random adaptive memory programming search for the capacitated clustering problem
- A two-phase hybrid metaheuristic for the vehicle routing problem with time windows
- Scheduling jobs on parallel machines with sequence-dependent setup times
- Early/tardy scheduling with sequence dependent setups on uniform parallel machines
- Parallel machine scheduling with earliness and tardiness penalties
- A tabu search algorithm for parallel machine total tardiness problem
- Greedy randomized adaptive search procedures
- Principles of scatter search
- Scatter search for project scheduling with resource availability cost
- A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows
- Minimizing Total Tardiness on One Machine is NP-Hard
- Textile Production Systems: a Succession of Non-identical Parallel Processor Shops
- An annotated bibliography of GRASP-Part II: Applications
- A multistart constructive heuristic for sequencing by hybridization using adaptive memory
- Sequencing with Earliness and Tardiness Penalties: A Review
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- Probability Theory
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
- The Total Tardiness Problem: Review and Extensions
- A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times
- Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
This page was built for publication: Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach
