Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
From MaRDI portal
Publication:5289668
DOI10.1057/jors.1993.24zbMath0778.90021OpenAlexW2003594644MaRDI QIDQ5289668
Publication date: 2 September 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1993.24
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (7)
Solving a stochastic single machine problem with initial idle time and quadratic objective ⋮ The local-global conjecture for scheduling with non-linear cost ⋮ Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires ⋮ Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints ⋮ Scheduling jobs on a single machine to maximize the total revenue of jobs ⋮ New search algorithm for solving the maintenance scheduling problem for a family of machines ⋮ For the airplane refueling problem local precedence implies global precedence
This page was built for publication: Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
