Minimizing a Quadratic Function of Job Lateness in the Single Machine System

DOI10.1080/02522667.1994.10699167zbMATH Open0803.90077OpenAlexW2026736723MaRDI QIDQ4298534FDOQ4298534

Authors: Tapan Sen, Farhad M. E. Raiszadeh 

Publication date: 2 August 1994

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

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

Recommendations

• Single machine jobshop scheduling problem with weighted quadratic function of job lateness: A branch-and-bound approach
• Minimizing the sum of squares lateness on a single machine
• Minimising a weighted quadratic function of job lateness in the stochastic single machine scheduling problem
• Solving a stochastic single machine problem with initial idle time and quadratic objective
• Minimizing the sum of absolute lateness in single-machine and multimachine scheduling

zbMATH Keywords

sum of squares of job lateness

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

Cited In (1)

• Minimizing the sum of squares lateness on a single machine

This page was built for publication: Minimizing a Quadratic Function of Job Lateness in the Single Machine System

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4298534)