Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach

DOI10.1080/02522667.1995.10699234zbMath0861.90077OpenAlexW2034190202MaRDI QIDQ4718640

Parthasarati Dileepan, Tapan Sen

Publication date: 8 December 1996

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1995.10699234

zbMATH Keywords

branch and-boundsingle machine systemsum of the weighted squares of lateness values

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution

This page was built for publication: Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach