Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
From MaRDI portal
Publication:282252
DOI10.1007/s10951-015-0429-xzbMath1341.90052MaRDI QIDQ282252
Publication date: 12 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0429-x
simulated annealing; single machine; variable neighborhood search; ant colony systems; weighted earliness tardiness
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
90B30: Production models
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Variable neighborhood search for the single machine scheduling problem to minimize the total early work, Distributionally robust single machine scheduling with the total tardiness criterion
Cites Work
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- Non-approximability of just-in-time scheduling
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process
- A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- An exact algorithm for single-machine scheduling without machine idle time
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A linear programming-based method for job shop scheduling
- Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
- Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
- A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
- Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times
- A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
- Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
