Single machine scheduling with nonlinear cost functions
From MaRDI portal
Publication:2277133
Recommendations
- Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions
- On the performance of Smith's rule in single-machine scheduling with nonlinear cost
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- scientific article; zbMATH DE number 4085399
Cites work
- A decomposition algorithm for the single machine total tardiness problem
- A dual algorithm for the one-machine scheduling problem
- A Dynamic Programming Approach to Sequencing Problems
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- scientific article; zbMATH DE number 4085401 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3550186 (Why is no real title available?)
- Minimizing Total Costs in One-Machine Scheduling
- Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
- On scheduling tasks with associated linear loss functions
- On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Structural analysis of local search heuristics in combinatorial optimization
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
Cited in
(21)- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- Scheduling crackdowns on illicit drug markets
- A variant of the permutation flow shop model with variable processing times
- A concise survey of scheduling with time-dependent processing times
- An exact approach for scheduling jobs with regular step cost functions on a single machine
- An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
- Optimal sequences in stochastic single machine shops
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
- Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit
- scientific article; zbMATH DE number 4085399 (Why is no real title available?)
- Scheduling on a bottleneck station: A comprehensive cost model and heuristic algorithms
- single Machine Preemptive Scheduling With Special Cost Functions1
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Order constraints for single machine scheduling with non-linear cost
- Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
- New search algorithm for solving the maintenance scheduling problem for a family of machines
- Single machine scheduling under market uncertainty
- Total completion time in a two-machine flowshop with deteriorating tasks
- Scheduling jobs on a single machine to maximize the total revenue of jobs
This page was built for publication: Single machine scheduling with nonlinear cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277133)
