Single machine scheduling with nonlinear cost functions

DOI10.1016/0305-0548(91)90033-NzbMath0724.90030MaRDI QIDQ2277133

Bahram Alidaee

Publication date: 1991

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

single machine; heuristic solution procedure

Mathematics Subject Classification ID

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

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, 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, Optimal sequences in stochastic single machine shops, Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural analysis of local search heuristics in combinatorial optimization
• A decomposition algorithm for the single machine total tardiness problem
• On Scheduling Tasks with Associated Linear Loss Functions
• A Dynamic Programming Approach to Sequencing Problems
• Analysis of a linearization heuristic for single-machine scheduling to maximize profit
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
• Minimizing Total Costs in One-Machine Scheduling
• A dual algorithm for the one-machine scheduling problem
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution