Two-Agent Single Machine Scheduling with Deteriorating Jobs and Rejection

We consider two two-agent scheduling problems with deteriorating jobs and rejection. Two agents A and B compete for the usage of a single machine. The actual processing time of job JjX is pjX=bjXa+bt, X∈A,B, where bjX is the normal processing time of JjX, a≥0, b≥0 and t denotes the starting time of...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical problems in engineering Vol. 2022; pp. 1 - 10
Main Authors:	Li, Dawei, Li, Ganggang, Cheng, Fangzheng
Format:	Journal Article
Language:	English
Published:	New York Hindawi 28.11.2022 John Wiley & Sons, Inc
Subjects:	Algorithms Approximation Completion time Dynamic programming Mathematical analysis Polynomials Rejection Schedules Scheduling Upper bounds
ISSN:	1024-123X, 1563-5147
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!