Scheduling linear deteriorating jobs with rejection on a single machine

We consider several single machine scheduling problems in which the processing time of a job is a linear function of its starting time and jobs can be rejected by paying penalties. The objectives are to minimize the makespan, the total weighted completion time and the maximum lateness/tardiness plus...

Full description

Saved in:

Bibliographic Details
Published in:	European journal of operational research Vol. 194; no. 1; pp. 18 - 27
Main Authors:	Cheng, Yushao, Sun, Shijie
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.04.2009 Elsevier Elsevier Sequoia S.A
Series:	European Journal of Operational Research
Subjects:	Algorithms Applied sciences Deteriorating jobs Dynamic programming Exact sciences and technology Inventory control, production control. Distribution Job shops Operational research and scientific management Operational research. Management science Optimization algorithms Production scheduling Rejection Scheduling Scheduling Deteriorating jobs Rejection Dynamic programming Scheduling, sequencing Studies Rejection Scheduling Dynamic programming Deteriorating jobs Optimal algorithm Task scheduling Processing time Makespan Polynomial method Approximation algorithm Delay Workload Polynomial time Minimum time NP hard problem Lateness Matrix polynomial Single machine Mathematical programming Completion time Execution time
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!