GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
type: Item
instance of: scholarly article
title: GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
zbMATH Open document ID: 1260.90096
author: Christian Blum
author: F. J. Rodriguez
author: C. García-Martínez
author: M. Lozano
published in: Annals of Operations Research
publication date: 2013-04-02T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6149335
zbMATH Keywords: non-identical parallel machine scheduling problem with minimising total weighted completion times
zbMATH Keywords: metaheuristics
zbMATH Keywords: GRASP
zbMATH Keywords: path-relinking
MaRDI profile type: Publication
full work available at URL: s10479-012-1164-8
OpenAlex ID: W2082168200
cites work: GRASP with path relinking for three-index assignment
cites work: Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
cites work: On the minimization of total weighted flow time with identical and uniform parallel machines
cites work: Scheduling with parallel processors and linear delay costs
cites work: Scheduling identical parallel machines to minimize total weighted completion time
cites work: Solving a chemical batch scheduling problem by local search
cites work: Scheduling independent tasks to reduce mean finishing time
cites work: Solving Parallel Machine Scheduling Problems by Column Generation
cites work: A state-of-the-art review of parallel-machine scheduling research
cites work: Scheduling a round robin tennis tournament under courts and players availability constraints
cites work: Iterated greedy local search methods for unrelated parallel machine scheduling
cites work: Scheduling unrelated parallel machines with optional machines and jobs selection
cites work: Efficient algorithms for machine scheduling problems with earliness and tardiness penalties
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Greedy randomized adaptive search procedures
cites work: A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 special session on real parameter optimization
cites work: Unrelated parallel machine scheduling using local search
cites work: Q4352217
cites work: Q4875178
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: Q4187195
cites work: Approximations of the critical region of the fbietkan statistic
cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
cites work: Q4124328
cites work: Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
cites work: Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
cites work: Scheduling with deadlines and loss functions
cites work: Q4546261
cites work: Nonlinear programming and genetic search application for production scheduling in coal mines
cites work: Task Scheduling in Networks
cites work: GRASP and path relinking for the max-min diversity problem
cites work: Q4452897
cites work: A GRASP with path-relinking for private virtual circuit routing
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: A hybrid GRASP with perturbations for the Steiner problem in graphs
cites work: A genetic approach for solving a scheduling problem in a robotized analytical system
cites work: An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
cites work: Scheduling Unrelated Machines by Randomized Rounding
cites work: Convex quadratic and semidefinite programming relaxations in scheduling
cites work: Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
cites work: Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
cites work: Hybrid meta-heuristics for minimizing the total weighted completion time on uniform parallel machines
DOI: 10.1007/S10479-012-1164-8
description: scientific article; zbMATH DE number 6149335