A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
type: Item
instance of: scholarly article
title: A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
zbMATH Open document ID: 1177.90196
author: Mateus Rocha de Paula
author: Geraldo Robson Mateus
author: Martín Gómez Ravetti
published in: Computers \& Operations Research
publication date: 2009-12-22T00:00:00Z
full work available at URL: http://hdl.handle.net/1959.13/923208
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5651581
zbMATH Keywords: scheduling problems
zbMATH Keywords: parallel machines
zbMATH Keywords: Lagrangean relaxation
zbMATH Keywords: relax-and-cut
MaRDI profile type: Publication
OpenAlex ID: W2075499597
cites work: A polyhedral approach to single-machine scheduling problems.
cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
cites work: Q4495496
cites work: Q4380372
cites work: Q4826104
cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: Efficient cuts in Lagrangean `relax-and-cut' schemes
cites work: Lagrangean relaxation. (With comments and rejoinder).
cites work: Variable neighborhood search: Principles and applications
cites work: Variable neighborhood search
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: Scheduling jobs on parallel machines with sequence-dependent setup times
cites work: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
cites work: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
cites work: Handbook of applied optimization
cites work: Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
cites work: Scheduling unrelated parallel machines to minimize total weighted tardiness.
cites work: Non delayed relax-and-cut algorithms
cites work: An exact algorithm for the identical parallel machine scheduling problem.
cites work: A cutting plane algorithm for the unrelated parallel machine scheduling problem
cites work: A high quality solution constructive heuristic for flow shop sequencing
cites work: Q3525910
cites work: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Q4877166
cites work: A time indexed formulation of non-preemptive single machine scheduling problems
cites work: Q4054818
DOI: 10.1016/J.COR.2009.07.006
description: scientific article; zbMATH DE number 5651581