Scheduling jobs on a single machine to maximize the total revenue of jobs
type: Item
instance of: scholarly article
title: Scheduling jobs on a single machine to maximize the total revenue of jobs
zbMATH Open document ID: 1157.90548
author: Wen-Hua Yang
published in: Computers \& Operations Research
publication date: 2008-11-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5363318
zbMATH Keywords: scheduling
zbMATH Keywords: single machine
zbMATH Keywords: total revenue
zbMATH Keywords: branch-and-bound algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2007.10.018
OpenAlex ID: W2049469870
cites work: Reducibility among single machine weighted completion time scheduling problems
cites work: Minimization of Time-Varying Costs in Single-Machine Scheduling
cites work: Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs
cites work: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
cites work: Variance Minimization in Single Machine Sequencing Problems
cites work: Minimizing Variation of Flow Time in Single Machine Systems
cites work: An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine
cites work: Single machine scheduling with nonlinear cost functions
cites work: Numerical Methods for Single Machine Scheduling with Non-linear Cost Functions to Minimize Total Cost
cites work: Single machine scheduling under market uncertainty
cites work: Cash Flows in Networks
cites work: Project network models with discounted cash flows a guided tour through recent developments
DOI: 10.1016/J.COR.2007.10.018
description: scientific article; zbMATH DE number 5363318