Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs
Publication:3902810
DOI10.1287/opre.29.1.146zbMath0454.90037OpenAlexW2067810840MaRDI QIDQ3902810
Lawrence K. Vanston, J. Wesley Barnes
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.1.146
traveling salesman problembranching rulescomputational experienceheuristic approachjob schedulingbranch-and-bound algorithmshybrid algorithmrandom test problemsone-machine sequencingcalculation of optimal strategiessequence dependent setup costslinear delay penaltiescontinuously available machinefathoming criterion
Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (14)
This page was built for publication: Scheduling Jobs with Linear Delay Penalties and Sequence Dependent Setup Costs