On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date

DOI10.1007/s11590-011-0385-0zbMath1258.90036OpenAlexW2005930106MaRDI QIDQ1926635

M. S. Beyranvand, M. Reza Peyghami, Mehdi Ghatee

Publication date: 28 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0385-0

zbMATH Keywords

parallel machine schedulingearliness and tardiness\(0-1\) quadratic programmingPlateau and Rios-Solis modelQCR method

Mathematics Subject Classification ID

Quadratic programming (90C20) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)

Related Items

Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time

Cites Work

• Unnamed Item
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
• Sequencing with Earliness and Tardiness Penalties: A Review
• Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates