Metaheuristics for the single machine weighted quadratic tardiness scheduling problem

DOI10.1016/j.cor.2016.01.004zbMath1391.90267OpenAlexW2236238877MaRDI QIDQ1651631

Jorge M. S. Valente, Tomás C. Gonçalves, Jeffrey E. Schaller

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/4954

zbMATH Keywords

schedulingmetaheuristicssingle machinegenetic algorithmiterated local searchvariable greedyweighted quadratic tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective ⋮ A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness ⋮ The job shop scheduling problem with convex costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A genetic algorithm for the set covering problem
• Variable neighborhood search
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• Minimizing the weighted sum of squared tardiness on a single machine
• Minimizing the sum of squares lateness on a single machine
• Combining simulated annealing with local search heuristics
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
• Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• AN EXACT APPROACH FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLY AND QUADRATIC TARDY PENALTIES
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm
• The Single Machine Early/Tardy Problem
• Genetic Algorithms

This page was built for publication: Metaheuristics for the single machine weighted quadratic tardiness scheduling problem