The Single Machine Problem with a Quadratic Cost Function of Completion Times

DOI10.1287/MNSC.34.12.1480MaRDI QIDQ3815117zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc, Marc E. Posner, John J. Liu

Publication date 1988

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.34.12.1480

zbMATH Keywords

adjacent jobsdecompositionprecedence relationquadratic cost functionsingle machine sequencing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• scientific article; zbMATH DE number 4033468
• Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
• Single facility sequencing with variable processing times and costs
• Publication:3481474

Cited in

(17)

• Solution of the generalized Townsend single machine scheduling model
• Minimizing the weighted sum of squared tardiness on a single machine
• Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem
• Minimizing the sum of squares lateness on a single machine
• The weighted common due date single machine scheduling problem revisited
• scientific article; zbMATH DE number 3845324 (Why is no real title available?)
• scientific article; zbMATH DE number 3864980 (Why is no real title available?)
• scientific article; zbMATH DE number 4033468 (Why is no real title available?)
• Single facility sequencing with variable processing times and costs
• scientific article; zbMATH DE number 527370 (Why is no real title available?)
• scientific article; zbMATH DE number 713581 (Why is no real title available?)
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• An experimental and analytical study of order constraints for single machine scheduling with quadratic cost
• Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
• Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
• Parametric precedence relations in single machine scheduling
• A scheduling problem with job values given as a power function of their completion times

This page was built for publication: The Single Machine Problem with a Quadratic Cost Function of Completion Times

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