Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach

DOI10.1080/02522667.1981.10698693MaRDI QIDQ3912340zbMATH OpenOpenAlexFDO

Authors P. C. Bagga, K. R. Kalra

Publication date 1981

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

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

zbMATH Keywords

branch-and-bound procedureminimization of a total quadratic penalty functionminimization of completion timesingle machine scheduling

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

(2)

• General stochastic single-machine scheduling with regular cost functions
• Single-machine scheduling with general costs under compound-type distributions

This page was built for publication: Single Machine Schednling Problem with Quadratic Function of Completion Times-A Modified Approach

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