Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling

DOI10.1057/jors.1995.105zbMath0833.90072OpenAlexW2073843479MaRDI QIDQ4849293

Wlodzimierz Szwarc, Samar K. Mukhopadhyay

Publication date: 9 November 1995

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1995.105

zbMATH Keywords

decompositionbranch-and-boundsingle machineprecedence relationweighted sum of squared waiting times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Single machine quadratic penalty function scheduling with deteriorating jobs and group technology ⋮ Minimizing the total waiting time of intermediate products in a manufacturing process ⋮ Online Scheduling with Machine Cost and a Quadratic Objective Function ⋮ Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem ⋮ Single-machine scheduling problems with precedence constraints and simple linear deterioration

This page was built for publication: Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling