Order constraints for single machine scheduling with non-linear cost

DOI10.1137/1.9781611973198.10MaRDI QIDQ5232495zbMATH OpenOpenAlexFDO

Authors Oscar C. Vásquez, Christoph Dürr

Publication date 12 September 2019

Published in 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973198.10

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling with nonlinear cost functions
• An experimental and analytical study of order constraints for single machine scheduling with quadratic cost
• Single machine scheduling problem with nonlinear processing times
• Complexity of single machine scheduling subject to nonnegative inventory constraints
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
• Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
• Single-machine scheduling problems with precedence constraints and simple linear deterioration
• Single machine batch scheduling with non-increasing time slot costs
• Single-machine scheduling with nonlinear deterioration
• Single-Machine Scheduling with Precedence Constraints

Cited in

(4)

• For the airplane refueling problem local precedence implies global precedence
• The local-global conjecture for scheduling with non-linear cost
• On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
• An experimental and analytical study of order constraints for single machine scheduling with quadratic cost

This page was built for publication: Order constraints for single machine scheduling with non-linear cost

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