Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints

DOI10.1016/J.ORL.2013.05.008MaRDI QIDQ2450684zbMATH OpenOpenAlexFDO

Authors Rodrigo A. Carrasco, G. Iyengar, Clifford Stein

Publication date 15 May 2014

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2013.05.008

zbMATH Keywords

alpha-pointsapproximation algorithmsjob-dependent convex costschedulingspeed scalingweighted tardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• single Machine Preemptive Scheduling With Special Cost Functions¹
• Resource cost aware scheduling
• Min-sum scheduling under precedence constraints
• A primal-dual approximation algorithm for min-sum single-machine scheduling problems
• Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

Cites work

• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• A primal-dual approximation algorithm for min-sum single-machine scheduling problems
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• An improved precedence rule for single machine sequencing problems with quadratic penalty
• Approximation techniques for average completion time scheduling
• scientific article; zbMATH DE number 830014 (Why is no real title available?)
• scientific article; zbMATH DE number 871909 (Why is no real title available?)
• scientific article; zbMATH DE number 6472636 (Why is no real title available?)
• List Scheduling in Order of α-Points on a Single Machine
• Minimizing average completion time in the presence of release dates
• Minimizing the weighted sum of squared tardiness on a single machine
• Note—A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem
• Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
• Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
• Optimal time-critical scheduling via resource augmentation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Single machine scheduling with nonlinear cost functions
• Single machine scheduling with release dates
• Speed is as powerful as clairvoyance
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution

Cited in

(11)

• Single machine precedence constrained scheduling is a Vertex cover problem
• Resource cost aware scheduling
• How unsplittable-flow-covering helps scheduling with job-dependent cost functions
• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
• Dual techniques for scheduling on a machine with varying speed
• single Machine Preemptive Scheduling With Special Cost Functions¹
• On the performance of Smith's rule in single-machine scheduling with nonlinear cost
• Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
• Order constraints for single machine scheduling with non-linear cost
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem

Describes a project that uses

Uses Software

• Gurobi
• Gurobi Mex

This page was built for publication: Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints

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