Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness
From MaRDI portal
Publication:639194
DOI10.1016/j.apm.2011.02.035zbMath1221.90049OpenAlexW1964096047MaRDI QIDQ639194
Publication date: 18 September 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.02.035
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
A mathematical model and heuristic algorithms for an unrelated parallel machine scheduling problem with sequence-dependent setup times, machine eligibility restrictions and a common server ⋮ A multi-objective optimization for preemptive identical parallel machines scheduling problem ⋮ Quantifying the impact of sharing resources in a collaborative warehouse ⋮ Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
Uses Software
Cites Work
- Parallel machine scheduling with splitting jobs
- A tabu search algorithm for parallel machine total tardiness problem
- Dynamic tabu list management using the reverse elimination method
- A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Tabu Search—Part I
- Tabu Search—Part II
- Parallel machine scheduling considering a job-splitting property
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Unnamed Item
- Unnamed Item
- Unnamed Item
