Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem

DOI10.1007/S40314-016-0370-4zbMath1397.90180OpenAlexW2499020330MaRDI QIDQ725705

D. Kharzeev

Publication date: 2 August 2018

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-016-0370-4

zbMATH Keywords

branch-and-bound algorithminteger programmingschedulingdynamic programmingheuristic algorithmtardy/lost penalty

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (1)

Research on construction and application for the model of multistage job shop scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey on offline scheduling with rejection
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• The single-machine total tardiness scheduling problem: review and extensions
• Approximation algorithms for scheduling a single machine to minimize total late work
• General stochastic single-machine scheduling with regular cost functions
• An exact approach for scheduling jobs with regular step cost functions on a single machine
• Single machine scheduling to minimize total weighted tardiness
• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
• Scheduling a single machine to minimize a regular objective function under setup constraints
• Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
• Scheduling with monotonous earliness and tardiness penalties
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• A note on ``Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function
• Single Machine Scheduling to Minimize Total Late Work
• Techniques for scheduling with rejection
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem