On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
type: Item
instance of: scholarly article
title: On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date
zbMATH Open document ID: 1258.90036
author: M. S. Beyranvand
author: M. Reza Peyghami
author: Mehdi Ghatee
published in: Optimization Letters
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6119207
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: Plateau and Rios-Solis model
zbMATH Keywords: \(0-1\) quadratic programming
zbMATH Keywords: earliness and tardiness
zbMATH Keywords: QCR method
MaRDI profile type: Publication
full work available at URL: s11590-011-0385-0
OpenAlex ID: W2005930106
cites work: Sequencing with Earliness and Tardiness Penalties: A Review
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates
cites work: A survey of the state-of-the-art of common due date assignment and scheduling research
cites work: Q4524243
cites work: Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
cites work: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
cites work: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
cites work: Combining column generation and Lagrangean relaxation to solve a single-machine common due date problem
DOI: 10.1007/S11590-011-0385-0
description: scientific article; zbMATH DE number 6119207