Scheduling jobs on a single machine to maximize the total revenue of jobs

DOI10.1016/j.cor.2007.10.018zbMath1157.90548OpenAlexW2049469870MaRDI QIDQ954056

Wen-Hua Yang

Publication date: 7 November 2008

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

Full work available at URL: https://doi.org/10.1016/j.cor.2007.10.018

zbMATH Keywords

branch-and-bound algorithmschedulingsingle machinetotal revenue

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A unified view of parallel machine scheduling with interdependent processing rates

Cites Work

• Single machine scheduling under market uncertainty
• Reducibility among single machine weighted completion time scheduling problems
• Project network models with discounted cash flows a guided tour through recent developments
• Single machine scheduling with nonlinear cost functions
• Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
• Minimizing Variation of Flow Time in Single Machine Systems
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Minimization of Time-Varying Costs in Single-Machine Scheduling
• An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
• Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
• Cash Flows in Networks
• Variance Minimization in Single Machine Sequencing Problems

This page was built for publication: Scheduling jobs on a single machine to maximize the total revenue of jobs